anchor.diff:                , valvex:add(Valvex, UpdatedBothQFifo, crossover_on_existing)),
   
     %% Verify the queues are the same as when we started
  -  ?assertEqual(ok, do_until(RawLifoFun, RawQLifo, 30)),
  -  ?assertEqual(ok, do_until(RawFifoFun, RawQFifo, 30)).
  +  ?assertEqual(ok, do_until(RawLifoFun, RawQLifo, 999999)),
  +  ?assertEqual(ok, do_until(RawFifoFun, RawQFifo, 999999)).
   
   test_get_available_workers(suite)                         -> [];
   test_get_available_workers({init, Config})                -> Config;
  
positive.code:   valvex:add(Valvex, UpdatedQLifo, crossover_on_existing),
    valvex:add(Valvex, UpdatedQFifo, crossover_on_existing),
    %% Verify the queues are updated
    ?assertEqual(ok, do_until(RawLifoFun, UpdatedQLifo, 30)),
    ?assertEqual(ok, do_until(RawFifoFun, UpdatedQFifo, 30)).
  
  test_crossover_errors(suite)                         -> [];
  test_crossover_errors({init, Config})                -> Config;
  
negative.code:   ?assertEqual(ok, valvex:push(Valvex, KeyLifo, SecondWorkFun)),
    ?assertEqual(ok, valvex:push(Valvex, KeyFifo, FirstWorkFun)),
    ?assertEqual(ok, valvex:push(Valvex, KeyFifo, SecondWorkFun)),
    ?assertEqual(ok, do_until(LifoSizeFun, 2, 999999)),
    ?assertEqual(ok, do_until(FifoSizeFun, 2, 999999)),
    %% Pop queues and check correct order
    ?assertMatch({{value, {SecondWorkFun, _}}, _}, valvex_queue:pop(valvex_queue_lifo_backend, KeyLifo)),
    ?assertMatch({{value, {FirstWorkFun, _}}, _}, valvex_queue:pop(valvex_queue_lifo_backend, KeyLifo)),
  