env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoDataRace.queue_longer.ats true


--------------------------------------------------------------------------------



Thanks for using JUnit! Support its development at https://junit.org/sponsoring

Test plan execution started. Number of static tests: 1
╷
├─ JUnit Jupiter
└─ JUnit Jupiter finished after 6 ms.
├─ JUnit Vintage
│  ├─ GraphEmpireOG
│  │  ├─ NoDataRace_queue_longer_ats
│  │  │       tags: []
│  │  │   uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoDataRace_queue_longer_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG)]
│  │  │     parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]
│  │  │     source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG', filePosition = null]
[WARN]: Using environment timeout: -1ms
[INFO]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/adds/z3
[INFO]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/adds/z3 SMTLIB2_COMPLIANT=true -t:1000 -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
[INFO]: [MP /storage/repos/ultimate/releaseScripts/default/adds/z3 SMTLIB2_COMPLIANT=true -t:1000 -memory:2024 -smt2 -in (1)] Waiting until timeout for monitored process
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Start isDeterministic. Operand 3 states and 3955 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1318.3333333333333) internal successors, (3955), 3 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3955 edges. 3955 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3950 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1316.6666666666667) internal successors, (3950), 3 states have internal predecessors, (3950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3950 edges. 3950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6894 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1149.0) internal successors, (6894), 6 states have internal predecessors, (6894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6894 edges. 6894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6893 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1148.8333333333333) internal successors, (6893), 6 states have internal predecessors, (6893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6893 edges. 6893 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6892 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1148.6666666666667) internal successors, (6892), 6 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6892 edges. 6892 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6906 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1151.0) internal successors, (6906), 6 states have internal predecessors, (6906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6906 edges. 6906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6905 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1150.8333333333333) internal successors, (6905), 6 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6905 edges. 6905 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3972 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1324.0) internal successors, (3972), 3 states have internal predecessors, (3972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3972 edges. 3972 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 7099 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1183.1666666666667) internal successors, (7099), 6 states have internal predecessors, (7099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 7099 edges. 7099 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3980 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1326.6666666666667) internal successors, (3980), 3 states have internal predecessors, (3980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3980 edges. 3980 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 7020 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1170.0) internal successors, (7020), 6 states have internal predecessors, (7020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 7020 edges. 7020 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 7050 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1175.0) internal successors, (7050), 6 states have internal predecessors, (7050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 7050 edges. 7050 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 7028 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1171.3333333333333) internal successors, (7028), 6 states have internal predecessors, (7028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 7028 edges. 7028 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 7027 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1171.1666666666667) internal successors, (7027), 6 states have internal predecessors, (7027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 7027 edges. 7027 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 7026 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1171.0) internal successors, (7026), 6 states have internal predecessors, (7026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 7026 edges. 7026 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 4903 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 817.1666666666666) internal successors, (4903), 6 states have internal predecessors, (4903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 4903 edges. 4903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6907 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1151.1666666666667) internal successors, (6907), 6 states have internal predecessors, (6907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6907 edges. 6907 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6906 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1151.0) internal successors, (6906), 6 states have internal predecessors, (6906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6906 edges. 6906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3971 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1323.6666666666667) internal successors, (3971), 3 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3971 edges. 3971 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 5108 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 851.3333333333334) internal successors, (5108), 6 states have internal predecessors, (5108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 5108 edges. 5108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3962 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1320.6666666666667) internal successors, (3962), 3 states have internal predecessors, (3962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3962 edges. 3962 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3965 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1321.6666666666667) internal successors, (3965), 3 states have internal predecessors, (3965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3965 edges. 3965 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3973 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1324.3333333333333) internal successors, (3973), 3 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3973 edges. 3973 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6858 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1143.0) internal successors, (6858), 6 states have internal predecessors, (6858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6858 edges. 6858 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6850 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1141.6666666666667) internal successors, (6850), 6 states have internal predecessors, (6850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6850 edges. 6850 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6854 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1142.3333333333333) internal successors, (6854), 6 states have internal predecessors, (6854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6854 edges. 6854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6843 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1140.5) internal successors, (6843), 6 states have internal predecessors, (6843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6843 edges. 6843 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6842 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1140.3333333333333) internal successors, (6842), 6 states have internal predecessors, (6842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6842 edges. 6842 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 6847 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 1141.1666666666667) internal successors, (6847), 6 states have internal predecessors, (6847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 6847 edges. 6847 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 4866 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 811.0) internal successors, (4866), 6 states have internal predecessors, (4866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 4866 edges. 4866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3952 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1317.3333333333333) internal successors, (3952), 3 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3952 edges. 3952 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 3 states and 3952 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 3 states, 3 states have (on average 1317.3333333333333) internal successors, (3952), 3 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[INFO]: Floyd-Hoare annotation has 3952 edges. 3952 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Number of proof automata: 32
[INFO]: 1309 / 1344 letters are loopers in proof 0
[INFO]: 1309 / 1344 letters are loopers in proof 1
[INFO]: 1112 / 1344 letters are loopers in proof 2
[INFO]: 1112 / 1344 letters are loopers in proof 3
[INFO]: 1112 / 1344 letters are loopers in proof 4
[INFO]: 1115 / 1344 letters are loopers in proof 5
[INFO]: 1115 / 1344 letters are loopers in proof 6
[INFO]: 1322 / 1344 letters are loopers in proof 7
[INFO]: 1143 / 1344 letters are loopers in proof 8
[INFO]: 1330 / 1344 letters are loopers in proof 9
[INFO]: 1113 / 1344 letters are loopers in proof 10
[INFO]: 1143 / 1344 letters are loopers in proof 11
[INFO]: 1115 / 1344 letters are loopers in proof 12
[INFO]: 1115 / 1344 letters are loopers in proof 13
[INFO]: 1115 / 1344 letters are loopers in proof 14
[INFO]: 717 / 1344 letters are loopers in proof 15
[INFO]: 1118 / 1344 letters are loopers in proof 16
[INFO]: 1118 / 1344 letters are loopers in proof 17
[INFO]: 1321 / 1344 letters are loopers in proof 18
[INFO]: 730 / 1344 letters are loopers in proof 19
[INFO]: 1315 / 1344 letters are loopers in proof 20
[INFO]: 1317 / 1344 letters are loopers in proof 21
[INFO]: 1319 / 1344 letters are loopers in proof 22
[INFO]: 1110 / 1344 letters are loopers in proof 23
[INFO]: 1109 / 1344 letters are loopers in proof 24
[INFO]: 1110 / 1344 letters are loopers in proof 25
[INFO]: 1108 / 1344 letters are loopers in proof 26
[INFO]: 1108 / 1344 letters are loopers in proof 27
[INFO]: 1109 / 1344 letters are loopers in proof 28
[INFO]: 711 / 1344 letters are loopers in proof 29
[INFO]: 1312 / 1344 letters are loopers in proof 30
[INFO]: 1312 / 1344 letters are loopers in proof 31
[INFO]: Loopers in proof automata: min=711, max=1330, median=1115
[INFO]: Start finitePrefix. Operand will be constructed on-demand