env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoDataRace.parallel-min-max-1.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 7 ms. ├─ JUnit Vintage │ ├─ GraphEmpireOG │ │ ├─ NoDataRace_parallel-min-max-1_wvr_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoDataRace_parallel-min-max-1_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]: Start isDeterministic. Operand 3 states and 720 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 1231 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 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 1231 edges. 1231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 727 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 1287 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 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 1287 edges. 1287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 10 states and 2170 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 2170 edges. 2170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 10 states and 2168 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 10 states, 10 states have (on average 216.8) internal successors, (2168), 10 states have internal predecessors, (2168), 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 2168 edges. 2168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 1305 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 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 1305 edges. 1305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 1295 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 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 1295 edges. 1295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 8 [INFO]: 228 / 267 letters are loopers in proof 0 [INFO]: 194 / 267 letters are loopers in proof 1 [INFO]: 248 / 267 letters are loopers in proof 2 [INFO]: 202 / 267 letters are loopers in proof 3 [INFO]: 209 / 267 letters are loopers in proof 4 [INFO]: 209 / 267 letters are loopers in proof 5 [INFO]: 214 / 267 letters are loopers in proof 6 [INFO]: 212 / 267 letters are loopers in proof 7 [INFO]: Loopers in proof automata: min=194, max=248, median=212 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: inserting event number 4 for the transition-marking pair ([51][222], [278#(= |#race~A~0| 0), l188, 267#true, 305#true, 295#true, l231, l135, l141, l137, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), l21, 313#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 285#true, 270#true]) [INFO]: this new event has 186 ancestors and is cut-off event [INFO]: existing Event has 177 ancestors and is cut-off event [INFO]: existing Event has 154 ancestors and is cut-off event [INFO]: existing Event has 168 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([52][223], [278#(= |#race~A~0| 0), l188, l131, 267#true, 295#true, 305#true, l135, l141, l137, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), l21, 313#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 285#true, 270#true]) [INFO]: this new event has 186 ancestors and is cut-off event [INFO]: existing Event has 168 ancestors and is cut-off event [INFO]: existing Event has 177 ancestors and is cut-off event [INFO]: existing Event has 154 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([51][222], [278#(= |#race~A~0| 0), 267#true, 305#true, 295#true, 311#true, l231, l135, l141, l137, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), l21, l192, 285#true, 270#true]) [INFO]: this new event has 187 ancestors and is cut-off event [INFO]: existing Event has 178 ancestors and is cut-off event [INFO]: existing Event has 169 ancestors and is cut-off event [INFO]: existing Event has 155 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([52][223], [278#(= |#race~A~0| 0), l131, 267#true, 305#true, 295#true, 311#true, l135, l141, l137, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), l21, l192, 285#true, 270#true]) [INFO]: this new event has 187 ancestors and is cut-off event [INFO]: existing Event has 178 ancestors and is cut-off event [INFO]: existing Event has 169 ancestors and is cut-off event [INFO]: existing Event has 155 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([99][232], [278#(= |#race~A~0| 0), 267#true, 295#true, 311#true, l135, l141, l169, l137, l18, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 309#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), l21, 270#true, 285#true]) [INFO]: this new event has 186 ancestors and is cut-off event [INFO]: existing Event has 154 ancestors and is cut-off event [INFO]: existing Event has 168 ancestors and is cut-off event [INFO]: existing Event has 177 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([100][233], [278#(= |#race~A~0| 0), l65, 267#true, 295#true, 311#true, l135, l141, l169, l137, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 309#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), l21, 270#true, 285#true]) [INFO]: this new event has 186 ancestors and is cut-off event [INFO]: existing Event has 154 ancestors and is cut-off event [INFO]: existing Event has 168 ancestors and is cut-off event [INFO]: existing Event has 177 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([99][232], [278#(= |#race~A~0| 0), 267#true, 295#true, 305#true, 311#true, l135, l234, l141, l137, l18, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), l21, 285#true, 270#true]) [INFO]: this new event has 187 ancestors and is cut-off event [INFO]: existing Event has 178 ancestors and is cut-off event [INFO]: existing Event has 169 ancestors and is cut-off event [INFO]: existing Event has 155 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([100][233], [278#(= |#race~A~0| 0), l65, 267#true, 295#true, 305#true, 311#true, l135, l234, l141, l137, 282#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), l21, 270#true, 285#true]) [INFO]: this new event has 187 ancestors and is cut-off event [INFO]: existing Event has 178 ancestors and is cut-off event [INFO]: existing Event has 169 ancestors and is cut-off event [INFO]: existing Event has 155 ancestors and is cut-off event [INFO]: 2679/6087 cut-off events. [INFO]: For 15506/16174 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 24409 conditions, 6087 events. 2679/6087 cut-off events. For 15506/16174 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 50175 event pairs, 1880 based on Foata normal form. 18/5440 useless extension candidates. Maximal degree in co-relation 19232. Up to 3211 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 5598ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 266 places, 267 transitions, 555 flow.