env EmpireAutomatonOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG' NoOverflow.stack-1.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 8 ms. ├─ JUnit Vintage │ ├─ EmpireAutomatonOG │ │ ├─ NoOverflow_stack-1_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG]/[test:NoOverflow_stack-1_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG)] │ │ │ parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG] │ │ │ source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG', 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]: Start isDeterministic. Operand 5 states and 820 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 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 820 edges. 820 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 488 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 4 states and 637 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 4 states, 4 states have (on average 159.25) internal successors, (637), 4 states have internal predecessors, (637), 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 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 793 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 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 793 edges. 793 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 788 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 157.6) internal successors, (788), 5 states have internal predecessors, (788), 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 788 edges. 788 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 804 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 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 804 edges. 804 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 490 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 763 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 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 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 7 states and 1038 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 7 states, 7 states have (on average 148.28571428571428) internal successors, (1038), 7 states have internal predecessors, (1038), 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 1038 edges. 1038 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 8 states and 1214 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 8 states, 8 states have (on average 151.75) internal successors, (1214), 8 states have internal predecessors, (1214), 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 1214 edges. 1214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 20 states and 3013 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 20 states, 20 states have (on average 150.65) internal successors, (3013), 20 states have internal predecessors, (3013), 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 3013 edges. 3013 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 7 states and 1113 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 7 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 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 1113 edges. 1113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 793 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 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 793 edges. 793 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 24 states and 3440 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 24 states, 24 states have (on average 143.33333333333334) internal successors, (3440), 24 states have internal predecessors, (3440), 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 3440 edges. 3440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 8 states and 1149 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 8 states, 8 states have (on average 143.625) internal successors, (1149), 8 states have internal predecessors, (1149), 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 1149 edges. 1149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 33 states and 4742 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 33 states, 33 states have (on average 143.6969696969697) internal successors, (4742), 33 states have internal predecessors, (4742), 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 4742 edges. 4742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 31 states and 4464 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 31 states, 31 states have (on average 144.0) internal successors, (4464), 31 states have internal predecessors, (4464), 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 4464 edges. 4464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 18 states and 2856 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 18 states, 18 states have (on average 158.66666666666666) internal successors, (2856), 18 states have internal predecessors, (2856), 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 2856 edges. 2856 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 18 [INFO]: 156 / 179 letters are loopers in proof 0 [INFO]: 163 / 179 letters are loopers in proof 1 [INFO]: 156 / 179 letters are loopers in proof 2 [INFO]: 156 / 179 letters are loopers in proof 3 [INFO]: 148 / 179 letters are loopers in proof 4 [INFO]: 156 / 179 letters are loopers in proof 5 [INFO]: 159 / 179 letters are loopers in proof 6 [INFO]: 145 / 179 letters are loopers in proof 7 [INFO]: 137 / 179 letters are loopers in proof 8 [INFO]: 144 / 179 letters are loopers in proof 9 [INFO]: 144 / 179 letters are loopers in proof 10 [INFO]: 156 / 179 letters are loopers in proof 11 [INFO]: 156 / 179 letters are loopers in proof 12 [INFO]: 137 / 179 letters are loopers in proof 13 [INFO]: 137 / 179 letters are loopers in proof 14 [INFO]: 137 / 179 letters are loopers in proof 15 [INFO]: 137 / 179 letters are loopers in proof 16 [INFO]: 156 / 179 letters are loopers in proof 17 [INFO]: Loopers in proof automata: min=137, max=163, median=156 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: inserting event number 4 for the transition-marking pair ([59][191], [l139, 362#(<= 5 |t1Thread1of1ForFork1_~i~0#1|), 269#(<= ~top~0 0), 192#(<= |t2Thread1of1ForFork0_~i~1#1| 4), 290#(<= 0 ~top~0), 254#true, 218#(<= ~top~0 1), 219#true, 331#(<= ~top~0 0), 237#(<= ~top~0 0), l30, 253#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 177#true, l120, 182#true, 194#true, 303#(<= ~top~0 0), l125, 199#true, 207#true, 206#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 188#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))]) [INFO]: this new event has 271 ancestors and is cut-off event [INFO]: existing Event has 181 ancestors and is cut-off event [INFO]: existing Event has 226 ancestors and is cut-off event [INFO]: existing Event has 136 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([59][191], [l26, 362#(<= 5 |t1Thread1of1ForFork1_~i~0#1|), 269#(<= ~top~0 0), 192#(<= |t2Thread1of1ForFork0_~i~1#1| 4), 254#true, 290#(<= 0 ~top~0), 218#(<= ~top~0 1), 219#true, 331#(<= ~top~0 0), 237#(<= ~top~0 0), l30, 253#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 177#true, 182#true, l120, 194#true, 303#(<= ~top~0 0), l125, 199#true, 207#true, 188#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 204#true]) [INFO]: this new event has 272 ancestors and is cut-off event [INFO]: existing Event has 137 ancestors and is cut-off event [INFO]: existing Event has 227 ancestors and is cut-off event [INFO]: existing Event has 182 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([59][191], [362#(<= 5 |t1Thread1of1ForFork1_~i~0#1|), 192#(<= |t2Thread1of1ForFork0_~i~1#1| 4), 269#(<= ~top~0 0), 254#true, 290#(<= 0 ~top~0), 218#(<= ~top~0 1), 219#true, 331#(<= ~top~0 0), l30, 237#(<= ~top~0 0), 253#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 177#true, 182#true, l120, 194#true, 303#(<= ~top~0 0), l125, 199#true, 207#true, 206#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), l25, 188#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))]) [INFO]: this new event has 280 ancestors and is cut-off event [INFO]: existing Event has 145 ancestors and is cut-off event [INFO]: existing Event has 235 ancestors and is cut-off event [INFO]: existing Event has 190 ancestors and is cut-off event [INFO]: inserting event number 5 for the transition-marking pair ([59][191], [l139, 362#(<= 5 |t1Thread1of1ForFork1_~i~0#1|), 192#(<= |t2Thread1of1ForFork0_~i~1#1| 4), 269#(<= ~top~0 0), 290#(<= 0 ~top~0), 254#true, 218#(<= ~top~0 1), 331#(<= ~top~0 0), 219#true, 237#(<= ~top~0 0), l30, 253#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 177#true, l120, 182#true, 194#true, 303#(<= ~top~0 0), l125, 199#true, 207#true, 206#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 188#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))]) [INFO]: this new event has 305 ancestors and is cut-off event [INFO]: existing Event has 181 ancestors and is cut-off event [INFO]: existing Event has 226 ancestors and is cut-off event [INFO]: existing Event has 136 ancestors and is cut-off event [INFO]: existing Event has 271 ancestors and is cut-off event [INFO]: inserting event number 5 for the transition-marking pair ([59][191], [l26, 362#(<= 5 |t1Thread1of1ForFork1_~i~0#1|), 269#(<= ~top~0 0), 192#(<= |t2Thread1of1ForFork0_~i~1#1| 4), 254#true, 290#(<= 0 ~top~0), 218#(<= ~top~0 1), 219#true, 331#(<= ~top~0 0), 237#(<= ~top~0 0), l30, 253#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 177#true, l120, 182#true, 194#true, 303#(<= ~top~0 0), 199#true, l125, 207#true, 204#true, 188#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))]) [INFO]: this new event has 306 ancestors and is cut-off event [INFO]: existing Event has 137 ancestors and is cut-off event [INFO]: existing Event has 227 ancestors and is cut-off event [INFO]: existing Event has 272 ancestors and is cut-off event [INFO]: existing Event has 182 ancestors and is cut-off event [INFO]: inserting event number 5 for the transition-marking pair ([59][191], [362#(<= 5 |t1Thread1of1ForFork1_~i~0#1|), 192#(<= |t2Thread1of1ForFork0_~i~1#1| 4), 269#(<= ~top~0 0), 254#true, 290#(<= 0 ~top~0), 218#(<= ~top~0 1), 219#true, 331#(<= ~top~0 0), 237#(<= ~top~0 0), l30, 253#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), l120, 182#true, 177#true, 194#true, 303#(<= ~top~0 0), l125, 199#true, 207#true, 206#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 188#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), l25]) [INFO]: this new event has 314 ancestors and is cut-off event [INFO]: existing Event has 145 ancestors and is cut-off event [INFO]: existing Event has 235 ancestors and is cut-off event [INFO]: existing Event has 280 ancestors and is cut-off event [INFO]: existing Event has 190 ancestors and is cut-off event [INFO]: 520/6586 cut-off events. [INFO]: For 135634/252857 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 30730 conditions, 6586 events. 520/6586 cut-off events. For 135634/252857 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 56857 event pairs, 68 based on Foata normal form. 21846/28149 useless extension candidates. Maximal degree in co-relation 28115. Up to 1837 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 67764ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 176 places, 179 transitions, 372 flow.