== replay_tie_seed6.txt n=21 k=4 arcs=53
  convex: True | (PC) by flow: True | (LOC): True | tight: True
  own J(v) at the failing vertex: [2, 3] (file: [2, 3] )
  pair (2,3): tails 4,15  l(i->j)=-178572/3000001  l(j->i)=178572/3000001  cycle length=0  | cost of the two indices now=-3523897/48000016 swapped=-3523897/48000016
  admissible assignments at the failing vertex (own enumeration): 2 [(4, 15), (15, 4)]
  (ARB) by exhaustive search (second implementation, node limit 3e6): True
  (ARB) by exhaustive search (first implementation): True | verified with explicit paths: True
  own construction, 64-bit random points, 20 runs: {'OK': 20}
  own construction, 8-bit random points, 300 runs: {'OK': 298, 'TIE': 2}
== replay_tie_seed1.txt n=19 k=4 arcs=49
  convex: True | (PC) by flow: True | (LOC): True | tight: True
  own J(v) at the failing vertex: [0, 1, 2, 3] (file: [0, 1, 2, 3] )
  pair (0,1): tails 10,11  l(i->j)=-107573/6000002  l(j->i)=107573/6000002  cycle length=0  | cost of the two indices now=-2258389/24000008 swapped=-2258389/24000008
  pair (0,3): tails 10,8  l(i->j)=-701334/3000001  l(j->i)=1249227/3000001  cycle length=547893/3000001  | cost of the two indices now=-8918779/12000004 swapped=-6727207/12000004
  pair (1,3): tails 11,8  l(i->j)=-3066267/12000004  l(j->i)=2530990/3000001  cycle length=7057693/12000004  | cost of the two indices now=-18533727/24000008 swapped=-4418341/24000008
  admissible assignments at the failing vertex (own enumeration): 6 [(8, 10, 2, 11), (8, 11, 2, 10), (10, 8, 2, 11), (10, 11, 2, 8), (11, 8, 2, 10), (11, 10, 2, 8)]
  (ARB) by exhaustive search (second implementation, node limit 3e6): True
  (ARB) by exhaustive search (first implementation): True | verified with explicit paths: True
  own construction, 64-bit random points, 20 runs: {'OK': 20}
  own construction, 8-bit random points, 300 runs: {'OK': 299, 'TIE': 1}
