env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoOverflow.04-mutex_10-ptrmunge_nr.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_04-mutex_10-ptrmunge_nr_ats
│  │  │       tags: []
│  │  │   uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoOverflow_04-mutex_10-ptrmunge_nr_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]: Start isDeterministic. Operand 7 states and 352 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 7 states have internal predecessors, (352), 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 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 7 states and 352 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 7 states have internal predecessors, (352), 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 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 15 states and 640 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 15 states, 15 states have (on average 42.666666666666664) internal successors, (640), 15 states have internal predecessors, (640), 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 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 15 states and 640 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 15 states, 15 states have (on average 42.666666666666664) internal successors, (640), 15 states have internal predecessors, (640), 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 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 25 states and 1054 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 25 states, 25 states have (on average 42.16) internal successors, (1054), 25 states have internal predecessors, (1054), 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 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 22 states and 929 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 22 states, 22 states have (on average 42.22727272727273) internal successors, (929), 22 states have internal predecessors, (929), 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 929 edges. 929 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 29 states and 1208 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 29 states, 29 states have (on average 41.6551724137931) internal successors, (1208), 29 states have internal predecessors, (1208), 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 1208 edges. 1208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 18 states and 763 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 18 states, 18 states have (on average 42.388888888888886) internal successors, (763), 18 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 19 states and 796 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 19 states, 19 states have (on average 41.89473684210526) internal successors, (796), 19 states have internal predecessors, (796), 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 796 edges. 796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 25 states and 1054 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 25 states, 25 states have (on average 42.16) internal successors, (1054), 25 states have internal predecessors, (1054), 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 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 22 states and 929 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 22 states, 22 states have (on average 42.22727272727273) internal successors, (929), 22 states have internal predecessors, (929), 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 929 edges. 929 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 29 states and 1208 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 29 states, 29 states have (on average 41.6551724137931) internal successors, (1208), 29 states have internal predecessors, (1208), 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 1208 edges. 1208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 18 states and 763 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 18 states, 18 states have (on average 42.388888888888886) internal successors, (763), 18 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 19 states and 796 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 19 states, 19 states have (on average 41.89473684210526) internal successors, (796), 19 states have internal predecessors, (796), 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 796 edges. 796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 26 states and 1091 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 26 states, 26 states have (on average 41.96153846153846) internal successors, (1091), 26 states have internal predecessors, (1091), 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 1091 edges. 1091 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 26 states and 1091 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 26 states, 26 states have (on average 41.96153846153846) internal successors, (1091), 26 states have internal predecessors, (1091), 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 1091 edges. 1091 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 31 states and 1272 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 31 states, 31 states have (on average 41.03225806451613) internal successors, (1272), 31 states have internal predecessors, (1272), 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 1272 edges. 1272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 31 states and 1272 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 31 states, 31 states have (on average 41.03225806451613) internal successors, (1272), 31 states have internal predecessors, (1272), 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 1272 edges. 1272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Number of proof automata: 18
[INFO]: 43 / 74 letters are loopers in proof 0
[INFO]: 43 / 74 letters are loopers in proof 1
[INFO]: 35 / 74 letters are loopers in proof 2
[INFO]: 35 / 74 letters are loopers in proof 3
[INFO]: 35 / 74 letters are loopers in proof 4
[INFO]: 35 / 74 letters are loopers in proof 5
[INFO]: 35 / 74 letters are loopers in proof 6
[INFO]: 35 / 74 letters are loopers in proof 7
[INFO]: 35 / 74 letters are loopers in proof 8
[INFO]: 35 / 74 letters are loopers in proof 9
[INFO]: 35 / 74 letters are loopers in proof 10
[INFO]: 35 / 74 letters are loopers in proof 11
[INFO]: 35 / 74 letters are loopers in proof 12
[INFO]: 35 / 74 letters are loopers in proof 13
[INFO]: 35 / 74 letters are loopers in proof 14
[INFO]: 35 / 74 letters are loopers in proof 15
[INFO]: 35 / 74 letters are loopers in proof 16
[INFO]: 35 / 74 letters are loopers in proof 17
[INFO]: Loopers in proof automata: min=35, max=43, median=35
[INFO]: Start finitePrefix. Operand will be constructed on-demand
[INFO]: 770/2095 cut-off events.
[INFO]: For 64836/76356 co-relation queries the response was YES.
[INFO]: Finished finitePrefix Result has 28352 conditions, 2095 events. 770/2095 cut-off events. For 64836/76356 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16194 event pairs, 28 based on Foata normal form. 9272/11359 useless extension candidates. Maximal degree in co-relation 28009. Up to 1036 conditions per place. 
[INFO]: OwickiGriesTestSuite setup time: 51700ms
[INFO]: Constructing Owicki-Gries proof for Petri program that has 78 places, 74 transitions, 155 flow.