anchor.diff:                   preemptions = Preemptions, last = {LLid,_,_}} = PrevTraceTop,
       NewN = I+1,
       ClockVector = lookup_clock(Lid, ClockMap),
  -    ?debug("Happened before: ~p\n", [dict:to_list(ClockVector)]),
  -    BaseClockVector = dict:store(Lid, NewN, ClockVector),
  +    ?debug("Happened before: ~p\n", [orddict:to_list(ClockVector)]),
  +    BaseClockVector = orddict:store(Lid, NewN, ClockVector),
       LidsClockVector = recent_dependency_cv(Selected, BaseClockVector, LidTrace),
       NewClockMap = dict:store(Lid, LidsClockVector, ClockMap),
       NewNexts = dict:store(Lid, Next, Nexts),
  
positive.code: new_lid_trace() ->
      queue:in({init_tr(), empty_clock_vector()}, queue:new()).
  
  empty_clock_vector() -> dict:new().
  
  -type trace_state() :: #trace_state{}.
  
  
negative.code: 
  max_cv(D1, D2) ->
      Merger = fun(_Key, V1, V2) -> max(V1, V2) end,
      orddict:merge(Merger, D1, D2).
  
  check_pollable(TraceTop) ->
      #trace_state{pollable = Pollable} = TraceTop,
  