env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' ReachSafety.triangular-longer-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 5 ms. ├─ JUnit Vintage │ ├─ GraphEmpireOG │ │ ├─ ReachSafety_triangular-longer-1_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:ReachSafety_triangular-longer-1_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 8 states and 424 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 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 424 edges. 424 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 13 states and 672 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.69230769230769) internal successors, (672), 13 states have internal predecessors, (672), 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 672 edges. 672 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 31 states and 1604 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.74193548387097) internal successors, (1604), 31 states have internal predecessors, (1604), 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 1604 edges. 1604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 32 states and 1663 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 32 states, 32 states have (on average 51.96875) internal successors, (1663), 32 states have internal predecessors, (1663), 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 1663 edges. 1663 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 55 states and 2836 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 55 states, 55 states have (on average 51.56363636363636) internal successors, (2836), 55 states have internal predecessors, (2836), 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 2836 edges. 2836 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 54 states and 2803 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 54 states, 54 states have (on average 51.907407407407405) internal successors, (2803), 54 states have internal predecessors, (2803), 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 2803 edges. 2803 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 90 states and 4358 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 90 states, 90 states have (on average 48.422222222222224) internal successors, (4358), 90 states have internal predecessors, (4358), 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 4358 edges. 4358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 64 states and 3311 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 64 states, 64 states have (on average 51.734375) internal successors, (3311), 64 states have internal predecessors, (3311), 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 3311 edges. 3311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 69 states and 3552 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 69 states, 69 states have (on average 51.47826086956522) internal successors, (3552), 69 states have internal predecessors, (3552), 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 3552 edges. 3552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 73 states and 3754 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 73 states, 73 states have (on average 51.42465753424658) internal successors, (3754), 73 states have internal predecessors, (3754), 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 3754 edges. 3754 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 33 states and 1769 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 33 states, 33 states have (on average 53.60606060606061) internal successors, (1769), 33 states have internal predecessors, (1769), 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 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 16 [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]: 41 / 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]: 48 / 62 letters are loopers in proof 14 [INFO]: 52 / 62 letters are loopers in proof 15 [INFO]: Loopers in proof automata: min=41, max=52, median=48 [INFO]: Start finitePrefix. Operand will be constructed on-demand Exception in thread "TimeoutWatcher for 1" java.lang.OutOfMemoryError: Java heap space at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.waitfor(MonitoredProcess.java:274) at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.impatientWaitUntilTimeout(MonitoredProcess.java:331) at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.lambda$3(MonitoredProcess.java:399) at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess$$Lambda/0x0000750a78112ae8.run(Unknown Source) at java.base/java.lang.Thread.runWith(Thread.java:1596) at java.base/java.lang.Thread.run(Thread.java:1583) │ │ │ caught: java.lang.OutOfMemoryError: Java heap space │ │ │  at java.base/java.util.LinkedHashMap.newNode(LinkedHashMap.java:281) │ │ │  at java.base/java.util.HashMap.putVal(HashMap.java:637) │ │ │  at java.base/java.util.HashMap.put(HashMap.java:618) │ │ │  at java.base/java.util.HashSet.add(HashSet.java:229) │ │ │  at java.base/java.util.AbstractCollection.addAll(AbstractCollection.java:338) │ │ │  at java.base/java.util.LinkedHashSet.(LinkedHashSet.java:182) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.(DifferencePetriNet.java:246) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet.getSuccessorTransitionProviders(DifferencePetriNet.java:193) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet.getSuccessorTransitionProviders(DifferencePetriNet.java:158) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.computeCandidates(PossibleExtensions.java:281) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:126) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OwickiGriesTestSuite.runTestInternal(OwickiGriesTestSuite.java:279) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OwickiGriesTestSuite$OwickiGriesTestCase.run(OwickiGriesTestSuite.java:547) │ │ │  at java.base/java.lang.invoke.DirectMethodHandle$Holder.invokeSpecial(DirectMethodHandle$Holder) │ │ │  at java.base/java.lang.invoke.LambdaForm$MH/0x0000750a78105000.invoke(LambdaForm$MH) │ │ │  at java.base/java.lang.invoke.Invokers$Holder.invokeExact_MT(Invokers$Holder) │ │ │  at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invokeImpl(DirectMethodHandleAccessor.java:153) │ │ │  at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103) │ │ │  at java.base/java.lang.reflect.Method.invoke(Method.java:580) │ │ │  at org.junit.runners.model.FrameworkMethod$1.runReflectiveCall(FrameworkMethod.java:59) │ │ │  at org.junit.internal.runners.model.ReflectiveCallable.run(ReflectiveCallable.java:12) │ │ │  at org.junit.runners.model.FrameworkMethod.invokeExplosively(FrameworkMethod.java:56) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FrameworkFactoryTest.invokeExplosively(FrameworkFactoryTest.java:72) │ │ │  at org.junit.internal.runners.statements.InvokeMethod.evaluate(InvokeMethod.java:17) │ │ │  at org.junit.internal.runners.statements.RunBefores.evaluate(RunBefores.java:26) │ │ │  at org.junit.runners.ParentRunner$3.evaluate(ParentRunner.java:306) │ │ │ duration: 34045 ms │ │ │ status: ✘ FAILED │ └─ GraphEmpireOG finished after 34050 ms. └─ JUnit Vintage finished after 34057 ms. ├─ JUnit Platform Suite └─ JUnit Platform Suite finished after 1 ms. Test plan execution finished. Number of all tests: 1  Test run finished after 34089 ms [ 4 containers found ] [ 0 containers skipped ] [ 4 containers started ] [ 0 containers aborted ] [ 4 containers successful ] [ 0 containers failed ] [ 1 tests found ] [ 0 tests skipped ] [ 1 tests started ] [ 0 tests aborted ] [ 0 tests successful ] [ 1 tests failed ]