Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110100291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DrinkVendingMachine-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110100291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 255M
-rw-r--r-- 1 mcc users 36K Apr 30 11:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 239K Apr 30 11:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31M Apr 30 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 100M Apr 30 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8M May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 11M May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.1K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 111M May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652656429989

Running Version 202205111006
[2022-05-15 23:13:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:13:54] [INFO ] Load time of PNML (sax parser for PT used): 2771 ms
[2022-05-15 23:13:54] [INFO ] Transformed 120 places.
[2022-05-15 23:13:54] [INFO ] Transformed 111160 transitions.
[2022-05-15 23:13:54] [INFO ] Parsed PT model containing 120 places and 111160 transitions in 3384 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 82500 transitions
Reduce redundant transitions removed 82500 transitions.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 113 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 28660/28660 transitions.
Applied a total of 0 rules in 920 ms. Remains 120 /120 variables (removed 0) and now considering 28660/28660 (removed 0) transitions.
// Phase 1: matrix 28660 rows 120 cols
[2022-05-15 23:13:56] [INFO ] Computed 60 place invariants in 178 ms
[2022-05-15 23:14:04] [INFO ] Dead Transitions using invariants and state equation in 8100 ms found 11000 transitions.
Found 11000 dead transitions using SMT.
Drop transitions removed 11000 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11000 transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:04] [INFO ] Computed 60 place invariants in 73 ms
[2022-05-15 23:14:04] [INFO ] Implicit Places using invariants in 143 ms returned []
Implicit Place search using SMT only with invariants took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/120 places, 17660/28660 transitions.
Applied a total of 0 rules in 62 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/28660 transitions.
Support contains 113 out of 120 places after structural reductions.
[2022-05-15 23:14:06] [INFO ] Flatten gal took : 1213 ms
[2022-05-15 23:14:07] [INFO ] Flatten gal took : 970 ms
[2022-05-15 23:14:09] [INFO ] Input system was already deterministic with 17660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1293 ms. (steps per millisecond=7 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:11] [INFO ] Computed 60 place invariants in 88 ms
[2022-05-15 23:14:11] [INFO ] [Real]Absence check using 60 positive place invariants in 6 ms returned sat
[2022-05-15 23:14:11] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 23:14:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 7 ms returned sat
[2022-05-15 23:14:16] [INFO ] After 4381ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2022-05-15 23:14:17] [INFO ] After 5520ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 624 ms.
[2022-05-15 23:14:18] [INFO ] After 6220ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 126 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 32 ms.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(p0)))&&X(p0))))'
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Applied a total of 0 rules in 67 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:18] [INFO ] Computed 60 place invariants in 74 ms
[2022-05-15 23:14:19] [INFO ] Implicit Places using invariants in 1392 ms returned []
Implicit Place search using SMT only with invariants took 1394 ms to find 0 implicit places.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:20] [INFO ] Computed 60 place invariants in 69 ms
[2022-05-15 23:14:24] [INFO ] Dead Transitions using invariants and state equation in 4908 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s31) (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 43 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-02 finished in 6735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(((G(p0) U G((p1 U p0)))||p2)))))'
Support contains 90 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Applied a total of 0 rules in 41 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:25] [INFO ] Computed 60 place invariants in 35 ms
[2022-05-15 23:14:26] [INFO ] Implicit Places using invariants in 1207 ms returned []
Implicit Place search using SMT only with invariants took 1209 ms to find 0 implicit places.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:26] [INFO ] Computed 60 place invariants in 36 ms
[2022-05-15 23:14:30] [INFO ] Dead Transitions using invariants and state equation in 4509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s77 s78 s79 s80 s83 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7464 ms.
Product exploration explored 100000 steps with 0 reset in 7477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1269 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 83321 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83321 steps, saw 74072 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:14:51] [INFO ] Computed 60 place invariants in 40 ms
[2022-05-15 23:14:51] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 23:14:51] [INFO ] [Nat]Absence check using 60 positive place invariants in 7 ms returned sat
[2022-05-15 23:14:57] [INFO ] After 5785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 23:15:01] [INFO ] After 9253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2129 ms.
[2022-05-15 23:15:03] [INFO ] After 11464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 129 steps, including 0 resets, run visited all 2 properties in 31 ms. (steps per millisecond=4 )
Parikh walk visited 7 properties in 90 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Support contains 90 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Applied a total of 0 rules in 39 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:15:04] [INFO ] Computed 60 place invariants in 36 ms
[2022-05-15 23:15:05] [INFO ] Implicit Places using invariants in 1229 ms returned []
Implicit Place search using SMT only with invariants took 1232 ms to find 0 implicit places.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:15:05] [INFO ] Computed 60 place invariants in 35 ms
[2022-05-15 23:15:10] [INFO ] Dead Transitions using invariants and state equation in 4770 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1192 ms. (steps per millisecond=8 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 88415 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88415 steps, saw 78094 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:15:15] [INFO ] Computed 60 place invariants in 35 ms
[2022-05-15 23:15:15] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 23:15:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 7 ms returned sat
[2022-05-15 23:15:21] [INFO ] After 5758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 23:15:25] [INFO ] After 9322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2090 ms.
[2022-05-15 23:15:27] [INFO ] After 11477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 129 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=4 )
Parikh walk visited 7 properties in 84 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 434 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 7272 ms.
Product exploration explored 100000 steps with 0 reset in 7281 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Support contains 90 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 2 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 120 transition count 17660
Deduced a syphon composed of 10 places in 2 ms
Applied a total of 10 rules in 16830 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
[2022-05-15 23:16:00] [INFO ] Flow matrix only has 460 transitions (discarded 17200 similar events)
// Phase 1: matrix 460 rows 120 cols
[2022-05-15 23:16:00] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-15 23:16:04] [INFO ] Dead Transitions using invariants and state equation in 4396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/120 places, 17660/17660 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Product exploration explored 100000 steps with 0 reset in 8760 ms.
Product exploration explored 100000 steps with 0 reset in 8755 ms.
Built C files in :
/tmp/ltsmin3727378081030729360
[2022-05-15 23:16:22] [INFO ] Built C files in 292ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3727378081030729360
Running compilation step : cd /tmp/ltsmin3727378081030729360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3727378081030729360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3727378081030729360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 90 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Applied a total of 0 rules in 37 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:16:25] [INFO ] Computed 60 place invariants in 31 ms
[2022-05-15 23:16:26] [INFO ] Implicit Places using invariants in 1172 ms returned []
Implicit Place search using SMT only with invariants took 1186 ms to find 0 implicit places.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:16:26] [INFO ] Computed 60 place invariants in 30 ms
[2022-05-15 23:16:31] [INFO ] Dead Transitions using invariants and state equation in 4925 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Built C files in :
/tmp/ltsmin8335759590162258218
[2022-05-15 23:16:31] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8335759590162258218
Running compilation step : cd /tmp/ltsmin8335759590162258218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8335759590162258218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8335759590162258218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:16:37] [INFO ] Flatten gal took : 1052 ms
[2022-05-15 23:16:37] [INFO ] Flatten gal took : 903 ms
[2022-05-15 23:16:38] [INFO ] Time to serialize gal into /tmp/LTL12261625999801953027.gal : 225 ms
[2022-05-15 23:16:38] [INFO ] Time to serialize properties into /tmp/LTL8589377240103583220.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12261625999801953027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8589377240103583220.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1226162...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((G("(((((((wait_1+wait_4)+(wait_5+wait_2))+((wait_3+wait_9)+(wait_8+wait_7)))+(((wait_6+wait_13)+(wait_12+wait_11))+((wait_1...1834
Formula 0 simplified : !GXG("(((((((ready_3+ready_2)+(ready_5+ready_4))+((ready_1+ready_11)+(ready_10+ready_13)))+(((ready_12+ready_7)+(ready_6+ready_9))+(...1821
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 23:16:54] [INFO ] Flatten gal took : 918 ms
[2022-05-15 23:16:54] [INFO ] Applying decomposition
[2022-05-15 23:16:55] [INFO ] Flatten gal took : 905 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3986060573294601339.txt' '-o' '/tmp/graph3986060573294601339.bin' '-w' '/tmp/graph3986060573294601339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3986060573294601339.bin' '-l' '-1' '-v' '-w' '/tmp/graph3986060573294601339.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:16:57] [INFO ] Decomposing Gal with order
[2022-05-15 23:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:17:05] [INFO ] Removed a total of 98700 redundant transitions.
[2022-05-15 23:17:05] [INFO ] Flatten gal took : 6719 ms
[2022-05-15 23:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 718 ms.
[2022-05-15 23:17:06] [INFO ] Time to serialize gal into /tmp/LTL69887047217990164.gal : 16 ms
[2022-05-15 23:17:06] [INFO ] Time to serialize properties into /tmp/LTL12570680515770326989.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL69887047217990164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12570680515770326989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6988704...265
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((G("(((((((gu11.wait_1+gu11.wait_4)+(gu11.wait_5+gu11.wait_2))+((gu11.wait_3+gu11.wait_9)+(gu11.wait_8+gu11.wait_7)))+(((gu1...2724
Formula 0 simplified : !GXG("(((((((gu12.ready_3+gu12.ready_2)+(gu12.ready_5+gu12.ready_4))+((gu12.ready_1+gu12.ready_11)+(gu12.ready_10+gu12.ready_13)))+(...2711
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14017462976576703159
[2022-05-15 23:17:21] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14017462976576703159
Running compilation step : cd /tmp/ltsmin14017462976576703159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14017462976576703159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14017462976576703159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-07 finished in 179595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 4 transition count 17602
Ensure Unique test removed 17596 transitions
Reduce isomorphic transitions removed 17596 transitions.
Iterating post reduction 0 with 17596 rules applied. Total rules applied 17770 place count 4 transition count 6
Applied a total of 17770 rules in 1321 ms. Remains 4 /120 variables (removed 116) and now considering 6/17660 (removed 17654) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:17:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:17:26] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:17:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:17:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2022-05-15 23:17:26] [INFO ] Redundant transitions in 21 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 23:17:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:17:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/120 places, 5/17660 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4/120 places, 5/17660 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-08 finished in 1582 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(true U X(G((G(p0) U X(G((false U !p0))))))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 4 transition count 17602
Ensure Unique test removed 17597 transitions
Reduce isomorphic transitions removed 17597 transitions.
Iterating post reduction 0 with 17597 rules applied. Total rules applied 17771 place count 4 transition count 5
Applied a total of 17771 rules in 1347 ms. Remains 4 /120 variables (removed 116) and now considering 5/17660 (removed 17655) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 23:17:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:17:27] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 23:17:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:17:27] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-15 23:17:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 23:17:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:17:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/120 places, 5/17660 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/120 places, 5/17660 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-10 finished in 1536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&(G(p0) U X(p2)))))'
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Applied a total of 0 rules in 34 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:17:28] [INFO ] Computed 60 place invariants in 33 ms
[2022-05-15 23:17:29] [INFO ] Implicit Places using invariants in 1900 ms returned []
Implicit Place search using SMT only with invariants took 1901 ms to find 0 implicit places.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:17:29] [INFO ] Computed 60 place invariants in 36 ms
[2022-05-15 23:17:34] [INFO ] Dead Transitions using invariants and state equation in 4593 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(AND (GT s9 s57) (GT s23 s98)), p2:(LEQ s9 s57), p0:(LEQ s23 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 40 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-11 finished in 6864 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U false)))'
Support contains 0 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 0 transition count 17600
Ensure Unique test removed 17599 transitions
Reduce isomorphic transitions removed 17599 transitions.
Iterating post reduction 0 with 17599 rules applied. Total rules applied 17779 place count 0 transition count 1
Applied a total of 17779 rules in 1258 ms. Remains 0 /120 variables (removed 120) and now considering 1/17660 (removed 17659) transitions.
[2022-05-15 23:17:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:17:36] [INFO ] Implicit Places using invariants in 4 ms returned []
[2022-05-15 23:17:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:17:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-15 23:17:36] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 23:17:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:17:36] [INFO ] Dead Transitions using invariants and state equation in 4 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/120 places, 1/17660 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/120 places, 1/17660 transitions.
Stuttering acceptance computed with spot in 22 ms :[true]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-12 finished in 1338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X(p0))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Applied a total of 0 rules in 58 ms. Remains 120 /120 variables (removed 0) and now considering 17660/17660 (removed 0) transitions.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:17:36] [INFO ] Computed 60 place invariants in 55 ms
[2022-05-15 23:17:38] [INFO ] Implicit Places using invariants in 1996 ms returned []
Implicit Place search using SMT only with invariants took 1997 ms to find 0 implicit places.
// Phase 1: matrix 17660 rows 120 cols
[2022-05-15 23:17:38] [INFO ] Computed 60 place invariants in 34 ms
[2022-05-15 23:17:42] [INFO ] Dead Transitions using invariants and state equation in 4503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 17660/17660 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s86 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 60 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-14 finished in 6868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 0 with 171 rules applied. Total rules applied 171 place count 6 transition count 17603
Ensure Unique test removed 17594 transitions
Reduce isomorphic transitions removed 17594 transitions.
Iterating post reduction 0 with 17594 rules applied. Total rules applied 17765 place count 6 transition count 9
Applied a total of 17765 rules in 1108 ms. Remains 6 /120 variables (removed 114) and now considering 9/17660 (removed 17651) transitions.
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 23:17:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-15 23:17:44] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 23:17:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-15 23:17:44] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-15 23:17:44] [INFO ] Redundant transitions in 24 ms returned [3, 4]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 23:17:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-15 23:17:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/120 places, 7/17660 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/120 places, 7/17660 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s1 s2) (OR (LEQ 3 s5) (GT 3 s5)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-15 finished in 1428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(((G(p0) U G((p1 U p0)))||p2)))))'
Found a SL insensitive property : DrinkVendingMachine-PT-10-LTLCardinality-07
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Support contains 90 out of 120 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 120/120 places, 17660/17660 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 100 transition count 17650
Ensure Unique test removed 17200 transitions
Reduce isomorphic transitions removed 17200 transitions.
Iterating post reduction 0 with 17200 rules applied. Total rules applied 17230 place count 100 transition count 450
Applied a total of 17230 rules in 696 ms. Remains 100 /120 variables (removed 20) and now considering 450/17660 (removed 17210) transitions.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:45] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:17:45] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:45] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-15 23:17:45] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:45] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:17:45] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 100/120 places, 450/17660 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/120 places, 450/17660 transitions.
Running random walk in product with property : DrinkVendingMachine-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s57 s58 s59 s60 s63 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 765 ms.
Product exploration explored 100000 steps with 0 reset in 812 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 532 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:50] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:17:50] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 23:17:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 5 ms returned sat
[2022-05-15 23:17:50] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 23:17:50] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 230 ms.
[2022-05-15 23:17:51] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 802 steps, including 0 resets, run visited all 5 properties in 31 ms. (steps per millisecond=25 )
Parikh walk visited 5 properties in 30 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 546 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Support contains 90 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 450/450 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:51] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:17:51] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:51] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-15 23:17:51] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:51] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-15 23:17:52] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 450/450 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 586 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:54] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:17:54] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 23:17:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 5 ms returned sat
[2022-05-15 23:17:55] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 23:17:55] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 238 ms.
[2022-05-15 23:17:55] [INFO ] After 843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 802 steps, including 0 resets, run visited all 5 properties in 38 ms. (steps per millisecond=21 )
Parikh walk visited 5 properties in 37 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 551 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 744 ms.
Product exploration explored 100000 steps with 0 reset in 954 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Support contains 90 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 450/450 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2022-05-15 23:17:58] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:17:58] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:17:58] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 450/450 transitions.
Product exploration explored 100000 steps with 0 reset in 723 ms.
Product exploration explored 100000 steps with 0 reset in 774 ms.
Built C files in :
/tmp/ltsmin603290069011171759
[2022-05-15 23:18:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin603290069011171759
Running compilation step : cd /tmp/ltsmin603290069011171759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 657 ms.
Running link step : cd /tmp/ltsmin603290069011171759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin603290069011171759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16003338517186856394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 90 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 450/450 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:18:15] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 23:18:15] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:18:15] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-15 23:18:15] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 450 rows 100 cols
[2022-05-15 23:18:15] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-15 23:18:15] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 450/450 transitions.
Built C files in :
/tmp/ltsmin54429563963335026
[2022-05-15 23:18:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin54429563963335026
Running compilation step : cd /tmp/ltsmin54429563963335026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin54429563963335026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin54429563963335026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5652792883438022000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 23:18:31] [INFO ] Flatten gal took : 12 ms
[2022-05-15 23:18:31] [INFO ] Flatten gal took : 15 ms
[2022-05-15 23:18:31] [INFO ] Time to serialize gal into /tmp/LTL2748698067243641130.gal : 4 ms
[2022-05-15 23:18:31] [INFO ] Time to serialize properties into /tmp/LTL1214538365900847634.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2748698067243641130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1214538365900847634.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2748698...266
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((G("(((((((wait_1+wait_4)+(wait_5+wait_2))+((wait_3+wait_9)+(wait_8+wait_7)))+(((wait_6+wait_13)+(wait_12+wait_11))+((wait_1...1834
Formula 0 simplified : !GXG("(((((((ready_3+ready_2)+(ready_5+ready_4))+((ready_1+ready_11)+(ready_10+ready_13)))+(((ready_12+ready_7)+(ready_6+ready_9))+(...1821
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 23:18:46] [INFO ] Flatten gal took : 13 ms
[2022-05-15 23:18:46] [INFO ] Applying decomposition
[2022-05-15 23:18:46] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph467387075366548078.txt' '-o' '/tmp/graph467387075366548078.bin' '-w' '/tmp/graph467387075366548078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph467387075366548078.bin' '-l' '-1' '-v' '-w' '/tmp/graph467387075366548078.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:18:46] [INFO ] Decomposing Gal with order
[2022-05-15 23:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:18:46] [INFO ] Removed a total of 1110 redundant transitions.
[2022-05-15 23:18:46] [INFO ] Flatten gal took : 136 ms
[2022-05-15 23:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2022-05-15 23:18:46] [INFO ] Time to serialize gal into /tmp/LTL11987577751439923193.gal : 2 ms
[2022-05-15 23:18:46] [INFO ] Time to serialize properties into /tmp/LTL9592801321121400354.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11987577751439923193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9592801321121400354.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1198757...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((G("(((((((gu1.wait_1+gu1.wait_4)+(gu1.wait_5+gu1.wait_2))+((gu1.wait_3+gu1.wait_9)+(gu1.wait_8+gu1.wait_7)))+(((gu1.wait_6+...2514
Formula 0 simplified : !GXG("(((((((gu2.ready_3+gu2.ready_2)+(gu2.ready_5+gu2.ready_4))+((gu2.ready_1+gu2.ready_11)+(gu2.ready_10+gu2.ready_13)))+(((gu2.re...2501
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11742289825463777956
[2022-05-15 23:19:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11742289825463777956
Running compilation step : cd /tmp/ltsmin11742289825463777956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 661 ms.
Running link step : cd /tmp/ltsmin11742289825463777956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin11742289825463777956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([]((([]((LTLAPp0==true)) U [](((LTLAPp1==true) U (LTLAPp0==true))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DrinkVendingMachine-PT-10-LTLCardinality-07 finished in 92488 ms.
[2022-05-15 23:19:18] [INFO ] Flatten gal took : 1657 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7846644199559458331
[2022-05-15 23:19:19] [INFO ] Too many transitions (17660) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:19:19] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7846644199559458331
Running compilation step : cd /tmp/ltsmin7846644199559458331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 23:19:20] [INFO ] Applying decomposition
[2022-05-15 23:19:22] [INFO ] Flatten gal took : 1533 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2775145429755732191.txt' '-o' '/tmp/graph2775145429755732191.bin' '-w' '/tmp/graph2775145429755732191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2775145429755732191.bin' '-l' '-1' '-v' '-w' '/tmp/graph2775145429755732191.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:19:25] [INFO ] Decomposing Gal with order
[2022-05-15 23:19:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:19:33] [INFO ] Removed a total of 98700 redundant transitions.
[2022-05-15 23:19:33] [INFO ] Flatten gal took : 7794 ms
[2022-05-15 23:19:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 453 ms.
[2022-05-15 23:19:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality11307632428485043500.gal : 19 ms
[2022-05-15 23:19:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality16797821583543392172.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11307632428485043500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16797821583543392172.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((G("(((((((gu11.wait_1+gu11.wait_4)+(gu11.wait_5+gu11.wait_2))+((gu11.wait_3+gu11.wait_9)+(gu11.wait_8+gu11.wait_7)))+(((gu1...2724
Formula 0 simplified : !GXG("(((((((gu12.ready_3+gu12.ready_2)+(gu12.ready_5+gu12.ready_4))+((gu12.ready_1+gu12.ready_11)+(gu12.ready_10+gu12.ready_13)))+(...2711
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 178629 ms.
Running link step : cd /tmp/ltsmin7846644199559458331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 147 ms.
Running LTSmin : cd /tmp/ltsmin7846644199559458331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([]((([]((LTLAPp0==true)) U [](((LTLAPp1==true) U (LTLAPp0==true))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 23:41:27] [INFO ] Flatten gal took : 2428 ms
[2022-05-15 23:41:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality1577965124986659257.gal : 492 ms
[2022-05-15 23:41:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality10362437684826073989.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1577965124986659257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10362437684826073989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(X(G(((G("(((((((wait_1+wait_4)+(wait_5+wait_2))+((wait_3+wait_9)+(wait_8+wait_7)))+(((wait_6+wait_13)+(wait_12+wait_11))+((wait_1...1834
Formula 0 simplified : !GXG("(((((((ready_3+ready_2)+(ready_5+ready_4))+((ready_1+ready_11)+(ready_10+ready_13)))+(((ready_12+ready_7)+(ready_6+ready_9))+(...1821
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 00:03:21] [INFO ] Flatten gal took : 2285 ms
[2022-05-16 00:03:24] [INFO ] Input system was already deterministic with 17660 transitions.
[2022-05-16 00:03:24] [INFO ] Transformed 120 places.
[2022-05-16 00:03:24] [INFO ] Transformed 17660 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 00:03:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality10438403795624881801.gal : 229 ms
[2022-05-16 00:03:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality6926420256128252297.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10438403795624881801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6926420256128252297.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(G(((G("(((((((wait_1+wait_4)+(wait_5+wait_2))+((wait_3+wait_9)+(wait_8+wait_7)))+(((wait_6+wait_13)+(wait_12+wait_11))+((wait_1...1834
Formula 0 simplified : !GXG("(((((((ready_3+ready_2)+(ready_5+ready_4))+((ready_1+ready_11)+(ready_10+ready_13)))+(((ready_12+ready_7)+(ready_6+ready_9))+(...1821

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110100291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-PT-10.tgz
mv DrinkVendingMachine-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;