anchor.diff:              trace_mpath:thread_yield(),
               receive
                   ?SCALARIS_RECV({continue_wait, WaitID},% ->
  -                               wait_for_clean_leases(WaitTimeInMs, TargetSize, false, NewState))
  +                               wait_for_clean_leases(WaitTimeInMs, Options, false, NewState))
               end
       end.
   
  --spec check_leases(OldState::leases_state(), TargetSize::pos_integer(), First::boolean()) ->
  +-spec check_leases(OldState::leases_state(), Options::options(), First::boolean()) ->
                             {boolean(), leases_state()}.
  -check_leases(OldState, TargetSize, First) ->
  +check_leases(OldState, Options, First) ->
       LastFailed = OldState#leases_state_t.last_failed,
       NewState = create_new_state(),
  +    TargetSize = renderTargetSize(Options),
       case {gb_trees:size(OldState#leases_state_t.node_infos),
             gb_trees:size(NewState#leases_state_t.node_infos)} of
           {Old, Old} ->
  
positive.code:                     gb_trees_filter(F, Acc, Iter2)
              end
      end.
  
negative.code: % @copyright 2012-2016 Zuse Institute Berlin,
  
  %   Licensed under the Apache License, Version 2.0 (the "License");
  %   you may not use this file except in compliance with the License.
  