env NaiveOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG' ReachSafety.triangular-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 4 ms.
├─ JUnit Vintage
│  ├─ NaiveOG
│  │  ├─ ReachSafety_triangular-1_ats
│  │  │       tags: []
│  │  │   uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG]/[test:ReachSafety_triangular-1_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG)]
│  │  │     parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG]
│  │  │     source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG', 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]: Start isDeterministic. Operand 10 states and 529 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 10 states, 10 states have (on average 52.9) internal successors, (529), 10 states have internal predecessors, (529), 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 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 422 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 52.75) internal successors, (422), 8 states have internal predecessors, (422), 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 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 10 states and 528 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 10 states, 10 states have (on average 52.8) internal successors, (528), 10 states have internal predecessors, (528), 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 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 9 states and 468 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 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 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 13 states and 681 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 13 states, 13 states have (on average 52.38461538461539) internal successors, (681), 13 states have internal predecessors, (681), 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 681 edges. 681 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 12 states and 621 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 12 states, 12 states have (on average 51.75) internal successors, (621), 12 states have internal predecessors, (621), 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 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 15 states and 775 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 15 states, 15 states have (on average 51.666666666666664) internal successors, (775), 15 states have internal predecessors, (775), 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 775 edges. 775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 13 states and 671 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 13 states, 13 states have (on average 51.61538461538461) internal successors, (671), 13 states have internal predecessors, (671), 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 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 23 states and 1203 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 23 states, 23 states have (on average 52.30434782608695) internal successors, (1203), 23 states have internal predecessors, (1203), 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 1203 edges. 1203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 33 states and 1710 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 33 states, 33 states have (on average 51.81818181818182) internal successors, (1710), 33 states have internal predecessors, (1710), 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 1710 edges. 1710 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 35 states and 1808 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 35 states, 35 states have (on average 51.65714285714286) internal successors, (1808), 35 states have internal predecessors, (1808), 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 1808 edges. 1808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 41 states and 2117 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 41 states, 41 states have (on average 51.63414634146341) internal successors, (2117), 41 states have internal predecessors, (2117), 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 2117 edges. 2117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 31 states and 1597 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 31 states, 31 states have (on average 51.516129032258064) internal successors, (1597), 31 states have internal predecessors, (1597), 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 1597 edges. 1597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 29 states and 1510 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 29 states, 29 states have (on average 52.06896551724138) internal successors, (1510), 29 states have internal predecessors, (1510), 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 1510 edges. 1510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 53 states and 2533 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 53 states, 53 states have (on average 47.79245283018868) internal successors, (2533), 53 states have internal predecessors, (2533), 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 2533 edges. 2533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 36 states and 1856 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 36 states, 36 states have (on average 51.55555555555556) internal successors, (1856), 36 states have internal predecessors, (1856), 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 1856 edges. 1856 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 34 states and 1758 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 34 states, 34 states have (on average 51.705882352941174) internal successors, (1758), 34 states have internal predecessors, (1758), 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 1758 edges. 1758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 38 states and 1958 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 38 states, 38 states have (on average 51.526315789473685) internal successors, (1958), 38 states have internal predecessors, (1958), 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 1958 edges. 1958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 36 states and 1858 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 36 states, 36 states have (on average 51.611111111111114) internal successors, (1858), 36 states have internal predecessors, (1858), 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 1858 edges. 1858 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 38 states and 1961 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 38 states, 38 states have (on average 51.60526315789474) internal successors, (1961), 38 states have internal predecessors, (1961), 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 1961 edges. 1961 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 63 states and 2991 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 63 states, 63 states have (on average 47.476190476190474) internal successors, (2991), 63 states have internal predecessors, (2991), 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 2991 edges. 2991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 18 states and 965 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 18 states, 18 states have (on average 53.611111111111114) internal successors, (965), 18 states have internal predecessors, (965), 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 965 edges. 965 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Number of proof automata: 22
[INFO]: 48 / 62 letters are loopers in proof 0
[INFO]: 48 / 62 letters are loopers in proof 1
[INFO]: 48 / 62 letters are loopers in proof 2
[INFO]: 48 / 62 letters are loopers in proof 3
[INFO]: 48 / 62 letters are loopers in proof 4
[INFO]: 48 / 62 letters are loopers in proof 5
[INFO]: 48 / 62 letters are loopers in proof 6
[INFO]: 48 / 62 letters are loopers in proof 7
[INFO]: 48 / 62 letters are loopers in proof 8
[INFO]: 48 / 62 letters are loopers in proof 9
[INFO]: 48 / 62 letters are loopers in proof 10
[INFO]: 48 / 62 letters are loopers in proof 11
[INFO]: 48 / 62 letters are loopers in proof 12
[INFO]: 48 / 62 letters are loopers in proof 13
[INFO]: 41 / 62 letters are loopers in proof 14
[INFO]: 48 / 62 letters are loopers in proof 15
[INFO]: 48 / 62 letters are loopers in proof 16
[INFO]: 48 / 62 letters are loopers in proof 17
[INFO]: 48 / 62 letters are loopers in proof 18
[INFO]: 48 / 62 letters are loopers in proof 19
[INFO]: 41 / 62 letters are loopers in proof 20
[INFO]: 52 / 62 letters are loopers in proof 21
[INFO]: Loopers in proof automata: min=41, max=52, median=48
[INFO]: Start finitePrefix. Operand will be constructed on-demand