anchor.diff:  			end,
   		    loop_receive_result(
   		      Parent, Debug, S,
  -		      TimerRefs, TimerTypes, Event)
  +		      TimerRefs, TimerTypes, CancelTimers, Event)
   	    end
       end.
   
   loop_receive_result(
     Parent, Debug, #{state := State} = S,
  -  TimerRefs, TimerTypes, Event) ->
  -    %% The fields 'timer_refs', 'timer_types' and 'hibernate'
  -    %% are now invalid in state map S - they will be recalculated
  -    %% and restored when we return to loop/3
  +  TimerRefs, TimerTypes, CancelTimers, Event) ->
  +    %% The field 'hibernate' is now invalid in state map S
  +    %% - it will be recalculated and restored when we return to loop/3
       %%
       NewDebug = sys_debug(Debug, S, State, {in,Event}),
       %% Here the queue of not yet handled events is created
       Events = [],
       Hibernate = false,
       loop_event(
  -      Parent, NewDebug, S, TimerRefs, TimerTypes, Events, Event, Hibernate).
  +      Parent, NewDebug, S, TimerRefs, TimerTypes, CancelTimers,
  +      Events, Event, Hibernate).
   
   %% Entry point for handling an event, received or enqueued
   loop_event(
  -  Parent, Debug, #{state := State, data := Data} = S, TimerRefs, TimerTypes,
  +  Parent, Debug, #{state := State, data := Data} = S,
  +  TimerRefs, TimerTypes, CancelTimers,
     Events, {Type,Content} = Event, Hibernate) ->
       %%
       %% If Hibernate is true here it can only be
  
positive.code: 		data := NewData,
  		timer_refs := TimerRefs,
  		timer_types := TimerTypes,
  		hibernate := Hibernate},
  	      [Event|Events])
      end.
  
  loop_event_enter_actions(
    Parent, Debug, #{state_enter := StateEnter} = S, TimerRefs, TimerTypes,
    Events, Event, NextState, NewData,
    Hibernate, TimeoutsR, Postpone, NextEventsR,
    Actions, EnterCall) ->
  
negative.code: 	      S#{
  		timer_refs := TimerRefs,
  		timer_types := TimerTypes,
  		cancel_timers := CancelTimers,
  		hibernate := Hibernate},
  	      Q, Replies);
  	{stop_and_reply,Reason,Replies,NewData} ->
  