env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoOverflow.chl-file-item-trans.wvr.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 5 ms.
├─ JUnit Vintage
│  ├─ GraphEmpireOG
│  │  ├─ NoOverflow_chl-file-item-trans_wvr_ats
│  │  │       tags: []
│  │  │   uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoOverflow_chl-file-item-trans_wvr_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]: Start isDeterministic. Operand 4 states and 1185 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 296.25) internal successors, (1185), 4 states have internal predecessors, (1185), 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 1185 edges. 1185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 1684 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 280.6666666666667) internal successors, (1684), 6 states have internal predecessors, (1684), 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 1684 edges. 1684 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1167 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 291.75) internal successors, (1167), 4 states have internal predecessors, (1167), 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 1167 edges. 1167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 1684 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 280.6666666666667) internal successors, (1684), 6 states have internal predecessors, (1684), 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 1684 edges. 1684 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 1683 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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 1683 edges. 1683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1162 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 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 1162 edges. 1162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1167 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 291.75) internal successors, (1167), 4 states have internal predecessors, (1167), 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 1167 edges. 1167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 1684 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 280.6666666666667) internal successors, (1684), 6 states have internal predecessors, (1684), 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 1684 edges. 1684 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1159 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 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 1159 edges. 1159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 1683 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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 1683 edges. 1683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1162 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 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 1162 edges. 1162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 2206 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 275.75) internal successors, (2206), 8 states have internal predecessors, (2206), 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 2206 edges. 2206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 2205 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 275.625) internal successors, (2205), 8 states have internal predecessors, (2205), 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 2205 edges. 2205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1159 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 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 1159 edges. 1159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 1930 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 275.7142857142857) internal successors, (1930), 7 states have internal predecessors, (1930), 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 1930 edges. 1930 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 1921 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 274.42857142857144) internal successors, (1921), 7 states have internal predecessors, (1921), 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 1921 edges. 1921 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 1683 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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 1683 edges. 1683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 2206 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 275.75) internal successors, (2206), 8 states have internal predecessors, (2206), 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 2206 edges. 2206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1162 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 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 1162 edges. 1162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 2205 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 275.625) internal successors, (2205), 8 states have internal predecessors, (2205), 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 2205 edges. 2205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 1930 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 275.7142857142857) internal successors, (1930), 7 states have internal predecessors, (1930), 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 1930 edges. 1930 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 4 states and 1159 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 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 1159 edges. 1159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 1921 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 274.42857142857144) internal successors, (1921), 7 states have internal predecessors, (1921), 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 1921 edges. 1921 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 2206 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 275.75) internal successors, (2206), 8 states have internal predecessors, (2206), 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 2206 edges. 2206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 2205 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 275.625) internal successors, (2205), 8 states have internal predecessors, (2205), 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 2205 edges. 2205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 1930 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 275.7142857142857) internal successors, (1930), 7 states have internal predecessors, (1930), 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 1930 edges. 1930 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 1921 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 274.42857142857144) internal successors, (1921), 7 states have internal predecessors, (1921), 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 1921 edges. 1921 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Number of proof automata: 27
[INFO]: 283 / 318 letters are loopers in proof 0
[INFO]: 274 / 318 letters are loopers in proof 1
[INFO]: 283 / 318 letters are loopers in proof 2
[INFO]: 274 / 318 letters are loopers in proof 3
[INFO]: 274 / 318 letters are loopers in proof 4
[INFO]: 282 / 318 letters are loopers in proof 5
[INFO]: 283 / 318 letters are loopers in proof 6
[INFO]: 274 / 318 letters are loopers in proof 7
[INFO]: 283 / 318 letters are loopers in proof 8
[INFO]: 274 / 318 letters are loopers in proof 9
[INFO]: 282 / 318 letters are loopers in proof 10
[INFO]: 269 / 318 letters are loopers in proof 11
[INFO]: 269 / 318 letters are loopers in proof 12
[INFO]: 283 / 318 letters are loopers in proof 13
[INFO]: 268 / 318 letters are loopers in proof 14
[INFO]: 268 / 318 letters are loopers in proof 15
[INFO]: 274 / 318 letters are loopers in proof 16
[INFO]: 269 / 318 letters are loopers in proof 17
[INFO]: 282 / 318 letters are loopers in proof 18
[INFO]: 269 / 318 letters are loopers in proof 19
[INFO]: 268 / 318 letters are loopers in proof 20
[INFO]: 283 / 318 letters are loopers in proof 21
[INFO]: 268 / 318 letters are loopers in proof 22
[INFO]: 269 / 318 letters are loopers in proof 23
[INFO]: 269 / 318 letters are loopers in proof 24
[INFO]: 268 / 318 letters are loopers in proof 25
[INFO]: 268 / 318 letters are loopers in proof 26
[INFO]: Loopers in proof automata: min=268, max=283, median=274
[INFO]: Start finitePrefix. Operand will be constructed on-demand