env EmpireAutomatonOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG' NoOverflow.13-privatized_52-refine-protected-loop2-small_true.ats false -------------------------------------------------------------------------------- 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 │ ├─ EmpireAutomatonOG │ │ ├─ NoOverflow_13-privatized_52-refine-protected-loop2-small_true_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG]/[test:NoOverflow_13-privatized_52-refine-protected-loop2-small_true_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG)] │ │ │ parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG] │ │ │ source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG', 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]: Number of proof automata: 2 [INFO]: 52 / 73 letters are loopers in proof 0 [INFO]: 52 / 73 letters are loopers in proof 1 [INFO]: Loopers in proof automata: min=52, max=52, median=52 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: 1/62 cut-off events. [INFO]: For 9/9 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 96 conditions, 62 events. 1/62 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 738ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 73 places, 73 transitions, 150 flow. [INFO]: Computed Owicki-Gries annotation with 1 ghost variables, 6 ghost updates, and overall size 2197 Assertions: l50 : 3#(and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) l52 : 6#(and (= v_g_1 5) (<= ~g~0 1000)) l51 : 9#(and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) l10 : 10#false l54 : 21#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l53 : 24#(and (<= ~g~0 1000) (= v_g_1 6)) l12 : 27#(and (<= ~g~0 1000) (= v_g_1 6)) l56 : 38#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l11 : 41#(and (= v_g_1 5) (<= ~g~0 1000)) l55 : 44#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l14 : 47#(= v_g_1 4) l58 : 50#(and (= v_g_1 5) (<= ~g~0 1000)) l13 : 51#false l57 : 54#(and (= v_g_1 5) (<= ~g~0 1000)) l16 : 57#(and (= v_g_1 5) (<= ~g~0 1000)) l15 : 60#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l59 : 63#(= v_g_1 4) l18 : 66#(and (<= ~g~0 1000) (= v_g_1 6)) l17 : 77#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l19 : 80#(and (= v_g_1 5) (<= ~g~0 1000)) l61 : 83#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l60 : 86#(and (= v_g_1 5) (<= ~g~0 1000)) l63 : 89#(= v_g_1 4) l62 : 92#(and (= v_g_1 5) (<= ~g~0 1000)) l21 : 93#false l65 : 96#(and (= v_g_1 5) (<= ~g~0 1000)) l20 : 99#(and (<= ~g~0 1000) (= v_g_1 6)) l64 : 100#false l23 : 103#(= v_g_1 4) l67 : 106#(and (= v_g_1 5) (<= ~g~0 1000)) l22 : 109#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l66 : 112#(and (= v_g_1 5) (<= ~g~0 1000)) l25 : 123#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l69 : 126#(and (= v_g_1 5) (<= ~g~0 1000)) l24 : 127#false l68 : 130#(and (= v_g_1 5) (<= ~g~0 1000)) l27 : 133#(and (= v_g_1 5) (<= ~g~0 1000)) l26 : 138#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1))) l29 : 141#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l28 : 144#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l0 : 147#(and (= v_g_1 5) (<= ~g~0 1000)) l70 : 150#(and (= v_g_1 5) (<= ~g~0 1000)) l1 : 155#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1))) l2 : 158#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l72 : 161#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l3 : 166#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1))) l71 : 169#(and (= v_g_1 5) (<= ~g~0 1000)) l4 : 172#(and (<= ~g~0 1000) (= v_g_1 6)) l30 : 175#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l5 : 176#false l6 : 177#false l32 : 180#(and (<= ~g~0 1000) (= v_g_1 1)) l7 : 191#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l31 : 194#(= v_g_1 4) l8 : 197#(and (= v_g_1 5) (<= ~g~0 1000)) l34 : 200#(and (= v_g_1 5) (<= ~g~0 1000)) l9 : 203#(and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000)) l33 : 214#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l36 : 217#(and (<= ~g~0 1000) (= v_g_1 6)) l35 : 218#false l38 : 221#(= v_g_1 4) l37 : 224#(and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) l39 : 227#(and (= v_g_1 5) (<= ~g~0 1000)) l41 : 238#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l40 : 241#(and (= v_g_1 5) (<= ~g~0 1000)) l43 : 244#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) l42 : 247#(= v_g_1 4) l45 : 250#(and (= v_g_1 5) (<= ~g~0 1000)) l44 : 255#(or (and (= v_g_1 5) (<= ~g~0 1000)) (= v_g_1 4)) l47 : 266#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l46 : 277#(or (and (<= ~g~0 1000) (= v_g_1 6)) (and (<= ~g~0 1000) (= v_g_1 1)) (and (= v_g_1 3) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000) (<= 1000 ~g~0)) (and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) (and (= v_g_1 7) (<= 1000 |workerThread1of1ForFork0_#t~post2#1|) (<= ~g~0 1000) (<= |workerThread1of1ForFork0_#t~post2#1| 1000))) l49 : 280#(and (= v_g_1 5) (<= ~g~0 1000)) l48 : 283#(and (<= ~g~0 1000) (<= 1000 ~g~0) (= v_g_1 2)) Ghost Variables (and initial values): v_g_1 : 4 Ghost Updates: [34][32] : (v_g_1) := ((ite (= v_g_1 6) 2 (ite (= v_g_1 1) 2 v_g_1))) [64][19] : (v_g_1) := ((ite (= v_g_1 5) 1 v_g_1)) [58][23] : (v_g_1) := ((ite (= v_g_1 3) 7 v_g_1)) [50][57] : (v_g_1) := ((ite (= v_g_1 2) 3 v_g_1)) [60][14] : (v_g_1) := ((ite (= v_g_1 7) 6 v_g_1)) [13][46] : (v_g_1) := ((ite (= v_g_1 4) 5 v_g_1)) [INFO]: EmpireComputation time [ms]: 1, EmpireComputation statistics: automaton size: 7, number of unique pairs: 7, empire law size: 58, empire annotation size: 65, number of regions: 10, number of territories: 7, Min number of regions per territory: 2, Max number of regions per territory: 3, Median number of regions per territory: 3, Min number of places per region: 1, Max number of places per region: 23, Median number of places per region: 7, Empire validity check time [ms]: 0, EmpireToOwickiGries time [ms]: 120, Owicki-Gries validity check time [ms]: 0 │ │ │ duration: 902 ms │ │ │ status: ✔ SUCCESSFUL │ └─ EmpireAutomatonOG finished after 907 ms. └─ JUnit Vintage finished after 915 ms. ├─ JUnit Platform Suite └─ JUnit Platform Suite finished after 1 ms. Test plan execution finished. Number of all tests: 1  Test run finished after 947 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 ] [ 1 tests successful ] [ 0 tests failed ]