env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoDataRace.chl-file-item-symm.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 6 ms. ├─ JUnit Vintage │ ├─ GraphEmpireOG │ │ ├─ NoDataRace_chl-file-item-symm_wvr_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoDataRace_chl-file-item-symm_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]: Start isDeterministic. Operand 3 states and 888 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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 888 edges. 888 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 880 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 874 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 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 874 edges. 874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 874 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 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 874 edges. 874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 874 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 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 874 edges. 874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 874 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 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 874 edges. 874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 886 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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 886 edges. 886 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 886 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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 886 edges. 886 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 888 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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 888 edges. 888 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 880 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 888 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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 888 edges. 888 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 893 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 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 893 edges. 893 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 893 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 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 893 edges. 893 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 880 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 882 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 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 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 884 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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 884 edges. 884 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 16 [INFO]: 289 / 313 letters are loopers in proof 0 [INFO]: 289 / 313 letters are loopers in proof 1 [INFO]: 286 / 313 letters are loopers in proof 2 [INFO]: 286 / 313 letters are loopers in proof 3 [INFO]: 286 / 313 letters are loopers in proof 4 [INFO]: 286 / 313 letters are loopers in proof 5 [INFO]: 295 / 313 letters are loopers in proof 6 [INFO]: 295 / 313 letters are loopers in proof 7 [INFO]: 295 / 313 letters are loopers in proof 8 [INFO]: 289 / 313 letters are loopers in proof 9 [INFO]: 295 / 313 letters are loopers in proof 10 [INFO]: 297 / 313 letters are loopers in proof 11 [INFO]: 297 / 313 letters are loopers in proof 12 [INFO]: 289 / 313 letters are loopers in proof 13 [INFO]: 294 / 313 letters are loopers in proof 14 [INFO]: 292 / 313 letters are loopers in proof 15 [INFO]: Loopers in proof automata: min=286, max=297, median=292 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: inserting event number 4 for the transition-marking pair ([253][188], [l290, 326#(= |#race~isNull_3~0| 0), 338#(= |#race~filename_1~0| 0), 323#(= |#race~isNull_0~0| 0), 312#true, 345#true, 344#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 348#true, 341#(= |#race~filename_4~0| 0), 306#true, l231, 329#(= |#race~filename_2~0| 0), 303#true, 315#true, 309#true, 335#(= |#race~filename_5~0| 0), l177, 318#true, 330#true, l178]) [INFO]: this new event has 144 ancestors and is cut-off event [INFO]: existing Event has 152 ancestors and is cut-off event [INFO]: existing Event has 152 ancestors and is cut-off event [INFO]: existing Event has 144 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([253][188], [326#(= |#race~isNull_3~0| 0), l290, 338#(= |#race~filename_1~0| 0), 323#(= |#race~isNull_0~0| 0), 312#true, 344#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 345#true, 348#true, 341#(= |#race~filename_4~0| 0), 306#true, 329#(= |#race~filename_2~0| 0), l172, 303#true, 309#true, 315#true, 335#(= |#race~filename_5~0| 0), l177, 318#true, 330#true, l178]) [INFO]: this new event has 145 ancestors and is cut-off event [INFO]: existing Event has 145 ancestors and is cut-off event [INFO]: existing Event has 153 ancestors and is cut-off event [INFO]: existing Event has 153 ancestors and is cut-off event [INFO]: inserting event number 5 for the transition-marking pair ([253][188], [326#(= |#race~isNull_3~0| 0), l290, 338#(= |#race~filename_1~0| 0), 323#(= |#race~isNull_0~0| 0), 312#true, 344#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 345#true, 348#true, 341#(= |#race~filename_4~0| 0), 306#true, 329#(= |#race~filename_2~0| 0), l172, 303#true, 315#true, 309#true, l177, 335#(= |#race~filename_5~0| 0), 318#true, 330#true, l178]) [INFO]: this new event has 181 ancestors and is cut-off event [INFO]: existing Event has 145 ancestors and is cut-off event [INFO]: existing Event has 145 ancestors and is cut-off event [INFO]: existing Event has 153 ancestors and is cut-off event [INFO]: existing Event has 153 ancestors and is cut-off event [INFO]: inserting event number 5 for the transition-marking pair ([253][188], [l290, 326#(= |#race~isNull_3~0| 0), 338#(= |#race~filename_1~0| 0), 323#(= |#race~isNull_0~0| 0), 312#true, 344#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 345#true, 348#true, 341#(= |#race~filename_4~0| 0), 306#true, l231, 329#(= |#race~filename_2~0| 0), 303#true, 309#true, 315#true, l177, 335#(= |#race~filename_5~0| 0), 318#true, 330#true, l178]) [INFO]: this new event has 180 ancestors and is cut-off event [INFO]: existing Event has 144 ancestors and is cut-off event [INFO]: existing Event has 152 ancestors and is cut-off event [INFO]: existing Event has 152 ancestors and is cut-off event [INFO]: existing Event has 144 ancestors and is cut-off event [INFO]: 185/2179 cut-off events. [INFO]: For 7064/7392 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 4004 conditions, 2179 events. 185/2179 cut-off events. For 7064/7392 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 17285 event pairs, 86 based on Foata normal form. 19/1995 useless extension candidates. Maximal degree in co-relation 3079. Up to 177 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 11233ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 302 places, 313 transitions, 640 flow.