Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628300198.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is LeafsetExtension-PT-S08C2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628300198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 647K May 18 16:42 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 LeafsetExtension-PT-S08C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S08C2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716562655104

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 14:57:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 14:57:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:57:38] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 14:57:38] [INFO ] Transformed 462 places.
[2024-05-24 14:57:38] [INFO ] Transformed 409 transitions.
[2024-05-24 14:57:38] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 377 transition count 409
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 156 place count 306 transition count 338
Iterating global reduction 1 with 71 rules applied. Total rules applied 227 place count 306 transition count 338
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 275 place count 258 transition count 290
Iterating global reduction 1 with 48 rules applied. Total rules applied 323 place count 258 transition count 290
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 369 place count 212 transition count 244
Iterating global reduction 1 with 46 rules applied. Total rules applied 415 place count 212 transition count 244
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 426 place count 201 transition count 244
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 435 place count 192 transition count 235
Iterating global reduction 2 with 9 rules applied. Total rules applied 444 place count 192 transition count 235
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 453 place count 183 transition count 226
Iterating global reduction 2 with 9 rules applied. Total rules applied 462 place count 183 transition count 226
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 471 place count 174 transition count 217
Iterating global reduction 2 with 9 rules applied. Total rules applied 480 place count 174 transition count 217
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 489 place count 165 transition count 208
Iterating global reduction 2 with 9 rules applied. Total rules applied 498 place count 165 transition count 208
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 523 place count 140 transition count 183
Iterating global reduction 2 with 25 rules applied. Total rules applied 548 place count 140 transition count 183
Applied a total of 548 rules in 90 ms. Remains 140 /462 variables (removed 322) and now considering 183/409 (removed 226) transitions.
[2024-05-24 14:57:38] [INFO ] Flow matrix only has 159 transitions (discarded 24 similar events)
// Phase 1: matrix 159 rows 140 cols
[2024-05-24 14:57:38] [INFO ] Computed 19 invariants in 14 ms
[2024-05-24 14:57:38] [INFO ] Implicit Places using invariants in 241 ms returned [19, 32, 36, 60, 72, 95, 115, 125]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 266 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/462 places, 183/409 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 118 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 118 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 116 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 116 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 114 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 114 transition count 165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 112 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 112 transition count 163
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 108 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 108 transition count 159
Applied a total of 48 rules in 9 ms. Remains 108 /132 variables (removed 24) and now considering 159/183 (removed 24) transitions.
[2024-05-24 14:57:38] [INFO ] Flow matrix only has 127 transitions (discarded 32 similar events)
// Phase 1: matrix 127 rows 108 cols
[2024-05-24 14:57:38] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 14:57:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 14:57:38] [INFO ] Flow matrix only has 127 transitions (discarded 32 similar events)
[2024-05-24 14:57:38] [INFO ] Invariant cache hit.
[2024-05-24 14:57:38] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/462 places, 159/409 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 528 ms. Remains : 108/462 places, 159/409 transitions.
Support contains 37 out of 108 places after structural reductions.
[2024-05-24 14:57:39] [INFO ] Flatten gal took : 31 ms
[2024-05-24 14:57:39] [INFO ] Flatten gal took : 13 ms
[2024-05-24 14:57:39] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 35 out of 108 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 14:57:39] [INFO ] Flow matrix only has 127 transitions (discarded 32 similar events)
[2024-05-24 14:57:39] [INFO ] Invariant cache hit.
[2024-05-24 14:57:39] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2024-05-24 14:57:39] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 14:57:39] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 14:57:39] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 159/159 transitions.
Graph (complete) has 237 edges and 108 vertex of which 75 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 75 transition count 93
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 61 place count 66 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 61 place count 66 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 61 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 56 transition count 73
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 56 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 56 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 56 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 52 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 52 transition count 68
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 108 place count 43 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 42 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 42 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 42 transition count 57
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 42 transition count 54
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 42 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 38 transition count 50
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 125 place count 38 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 128 place count 35 transition count 47
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 136 place count 35 transition count 47
Applied a total of 136 rules in 32 ms. Remains 35 /108 variables (removed 73) and now considering 47/159 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 35/108 places, 47/159 transitions.
Finished random walk after 684 steps, including 108 resets, run visited all 1 properties in 3 ms. (steps per millisecond=228 )
Parikh walk visited 0 properties in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 108 stabilizing places and 159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 159
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(X(p1) U ((!p2&&X(p1))||X(G(p1)))))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 149
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 91 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 91 transition count 142
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 86 transition count 142
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 78 transition count 134
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 78 transition count 134
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 73 transition count 129
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 73 transition count 129
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 69 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 69 transition count 125
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 65 transition count 121
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 65 transition count 121
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 90 place count 56 transition count 112
Iterating global reduction 1 with 9 rules applied. Total rules applied 99 place count 56 transition count 112
Applied a total of 99 rules in 10 ms. Remains 56 /108 variables (removed 52) and now considering 112/159 (removed 47) transitions.
[2024-05-24 14:57:39] [INFO ] Flow matrix only has 62 transitions (discarded 50 similar events)
// Phase 1: matrix 62 rows 56 cols
[2024-05-24 14:57:39] [INFO ] Computed 6 invariants in 3 ms
[2024-05-24 14:57:39] [INFO ] Implicit Places using invariants in 46 ms returned [28, 38, 45]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/108 places, 112/159 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 105
Applied a total of 14 rules in 2 ms. Remains 46 /53 variables (removed 7) and now considering 105/112 (removed 7) transitions.
[2024-05-24 14:57:39] [INFO ] Flow matrix only has 52 transitions (discarded 53 similar events)
// Phase 1: matrix 52 rows 46 cols
[2024-05-24 14:57:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 14:57:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 14:57:39] [INFO ] Flow matrix only has 52 transitions (discarded 53 similar events)
[2024-05-24 14:57:39] [INFO ] Invariant cache hit.
[2024-05-24 14:57:39] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/108 places, 105/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 46/108 places, 105/159 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s22 1), p0:(OR (LT s22 1) (LT s18 1) (LT s40 1)), p2:(AND (GEQ s26 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 331 ms.
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Computed a total of 46 stabilizing places and 105 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 105
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND p0 p2))), true, (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-00 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(X((G(p1)&&p0))) U X((G(p2)||!p2))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 99 transition count 150
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 99 transition count 150
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 92 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 92 transition count 143
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 88 transition count 143
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 81 transition count 136
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 81 transition count 136
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 77 transition count 132
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 77 transition count 132
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 73 transition count 128
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 73 transition count 128
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 69 transition count 124
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 69 transition count 124
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 58 transition count 113
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 58 transition count 113
Applied a total of 96 rules in 6 ms. Remains 58 /108 variables (removed 50) and now considering 113/159 (removed 46) transitions.
[2024-05-24 14:57:40] [INFO ] Flow matrix only has 62 transitions (discarded 51 similar events)
// Phase 1: matrix 62 rows 58 cols
[2024-05-24 14:57:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 14:57:40] [INFO ] Implicit Places using invariants in 42 ms returned [25, 31, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/108 places, 113/159 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 49 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 49 transition count 107
Applied a total of 12 rules in 1 ms. Remains 49 /55 variables (removed 6) and now considering 107/113 (removed 6) transitions.
[2024-05-24 14:57:40] [INFO ] Flow matrix only has 53 transitions (discarded 54 similar events)
// Phase 1: matrix 53 rows 49 cols
[2024-05-24 14:57:40] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 14:57:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 14:57:40] [INFO ] Flow matrix only has 53 transitions (discarded 54 similar events)
[2024-05-24 14:57:40] [INFO ] Invariant cache hit.
[2024-05-24 14:57:41] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/108 places, 107/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 49/108 places, 107/159 transitions.
Stuttering acceptance computed with spot in 571 ms :[p1, true, true, true, p2, (OR p2 (AND p0 p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p0 p1), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s18 1) (GEQ s29 1)), p2:(AND (GEQ s35 1) (GEQ s37 1)), p0:(AND (GEQ s14 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-02 finished in 724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(X(p2)&&p1))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 151
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 94 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 94 transition count 145
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 90 transition count 145
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 84 transition count 139
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 84 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 80 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 80 transition count 135
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 76 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 76 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 72 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 72 transition count 127
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 62 transition count 117
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 62 transition count 117
Applied a total of 88 rules in 11 ms. Remains 62 /108 variables (removed 46) and now considering 117/159 (removed 42) transitions.
[2024-05-24 14:57:41] [INFO ] Flow matrix only has 67 transitions (discarded 50 similar events)
// Phase 1: matrix 67 rows 62 cols
[2024-05-24 14:57:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 14:57:41] [INFO ] Implicit Places using invariants in 44 ms returned [21, 26, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/108 places, 117/159 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 51 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 51 transition count 109
Applied a total of 16 rules in 1 ms. Remains 51 /59 variables (removed 8) and now considering 109/117 (removed 8) transitions.
[2024-05-24 14:57:41] [INFO ] Flow matrix only has 56 transitions (discarded 53 similar events)
// Phase 1: matrix 56 rows 51 cols
[2024-05-24 14:57:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 14:57:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 14:57:41] [INFO ] Flow matrix only has 56 transitions (discarded 53 similar events)
[2024-05-24 14:57:41] [INFO ] Invariant cache hit.
[2024-05-24 14:57:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/108 places, 109/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 51/108 places, 109/159 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s33 1) (GEQ s0 1) (GEQ s16 1)), p1:(AND (GEQ s24 1) (GEQ s29 1)), p2:(GEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-03 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 97 transition count 148
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 97 transition count 148
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 89 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 89 transition count 140
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 84 transition count 140
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 76 transition count 132
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 76 transition count 132
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 71 transition count 127
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 71 transition count 127
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 66 transition count 122
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 66 transition count 122
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 61 transition count 117
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 61 transition count 117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 48 transition count 104
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 place count 48 transition count 104
Applied a total of 115 rules in 8 ms. Remains 48 /108 variables (removed 60) and now considering 104/159 (removed 55) transitions.
[2024-05-24 14:57:41] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 48 cols
[2024-05-24 14:57:41] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 14:57:41] [INFO ] Implicit Places using invariants in 38 ms returned [21, 25, 31, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/108 places, 104/159 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 36 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 36 transition count 96
Applied a total of 16 rules in 1 ms. Remains 36 /44 variables (removed 8) and now considering 96/104 (removed 8) transitions.
[2024-05-24 14:57:41] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
// Phase 1: matrix 36 rows 36 cols
[2024-05-24 14:57:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 14:57:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 14:57:41] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
[2024-05-24 14:57:41] [INFO ] Invariant cache hit.
[2024-05-24 14:57:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/108 places, 96/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 36/108 places, 96/159 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (GEQ s14 1) (GEQ s15 1)), p0:(AND (GEQ s1 1) (GEQ s28 1))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-04 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1&&F(p2)))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Graph (complete) has 327 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 107 transition count 149
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 98 transition count 149
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 19 place count 98 transition count 142
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 33 place count 91 transition count 142
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 83 transition count 134
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 83 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 49 place count 83 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 82 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 80 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 80 transition count 131
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 79 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 79 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 78 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 77 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 77 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 76 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 76 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 74 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 74 transition count 126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 88 place count 63 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 61 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 61 transition count 113
Applied a total of 92 rules in 38 ms. Remains 61 /108 variables (removed 47) and now considering 113/159 (removed 46) transitions.
[2024-05-24 14:57:42] [INFO ] Flow matrix only has 71 transitions (discarded 42 similar events)
// Phase 1: matrix 71 rows 61 cols
[2024-05-24 14:57:42] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:57:42] [INFO ] Implicit Places using invariants in 145 ms returned [21, 30, 37, 39, 46, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 158 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/108 places, 113/159 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 55 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 46 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 46 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 45 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 45 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 44 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 44 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 34 place count 38 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 37 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 37 transition count 95
Applied a total of 36 rules in 24 ms. Remains 37 /55 variables (removed 18) and now considering 95/113 (removed 18) transitions.
[2024-05-24 14:57:42] [INFO ] Flow matrix only has 41 transitions (discarded 54 similar events)
// Phase 1: matrix 41 rows 37 cols
[2024-05-24 14:57:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 14:57:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 14:57:42] [INFO ] Flow matrix only has 41 transitions (discarded 54 similar events)
[2024-05-24 14:57:42] [INFO ] Invariant cache hit.
[2024-05-24 14:57:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/108 places, 95/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 37/108 places, 95/159 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s18 1) (LT s20 1)), p0:(OR (LT s23 1) (LT s24 1)), p2:(OR (LT s9 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10425 reset in 225 ms.
Product exploration explored 100000 steps with 10412 reset in 183 ms.
Computed a total of 37 stabilizing places and 95 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 37 transition count 95
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p1)), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 14 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-05 finished in 1013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(G(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 149
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 91 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 91 transition count 142
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 87 transition count 142
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 81 transition count 136
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 81 transition count 136
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 77 transition count 132
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 77 transition count 132
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 73 transition count 128
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 73 transition count 128
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 69 transition count 124
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 69 transition count 124
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 58 transition count 113
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 58 transition count 113
Applied a total of 96 rules in 12 ms. Remains 58 /108 variables (removed 50) and now considering 113/159 (removed 46) transitions.
[2024-05-24 14:57:43] [INFO ] Flow matrix only has 61 transitions (discarded 52 similar events)
// Phase 1: matrix 61 rows 58 cols
[2024-05-24 14:57:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 14:57:43] [INFO ] Implicit Places using invariants in 42 ms returned [21, 25, 31, 46]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/108 places, 113/159 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 45 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 45 transition count 104
Applied a total of 18 rules in 2 ms. Remains 45 /54 variables (removed 9) and now considering 104/113 (removed 9) transitions.
[2024-05-24 14:57:43] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 45 cols
[2024-05-24 14:57:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 14:57:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 14:57:43] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
[2024-05-24 14:57:43] [INFO ] Invariant cache hit.
[2024-05-24 14:57:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/108 places, 104/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 45/108 places, 104/159 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s31 1) (LT s33 1)), p1:(OR (LT s17 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 703 steps with 38 reset in 2 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-12 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Graph (complete) has 327 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 107 transition count 147
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 96 transition count 147
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 23 place count 96 transition count 140
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 89 transition count 140
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 47 place count 79 transition count 130
Iterating global reduction 2 with 10 rules applied. Total rules applied 57 place count 79 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 57 place count 79 transition count 128
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 77 transition count 128
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 74 transition count 125
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 74 transition count 125
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 62 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 61 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 61 transition count 112
Applied a total of 93 rules in 23 ms. Remains 61 /108 variables (removed 47) and now considering 112/159 (removed 47) transitions.
[2024-05-24 14:57:43] [INFO ] Flow matrix only has 74 transitions (discarded 38 similar events)
// Phase 1: matrix 74 rows 61 cols
[2024-05-24 14:57:43] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 14:57:43] [INFO ] Implicit Places using invariants in 50 ms returned [10, 17, 19, 23, 25, 35, 37, 44, 48]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 52 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/108 places, 112/159 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 39 transition count 99
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 39 transition count 99
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 35 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 35 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 31 transition count 91
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 31 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 28 transition count 88
Applied a total of 48 rules in 7 ms. Remains 28 /52 variables (removed 24) and now considering 88/112 (removed 24) transitions.
[2024-05-24 14:57:43] [INFO ] Flow matrix only has 30 transitions (discarded 58 similar events)
// Phase 1: matrix 30 rows 28 cols
[2024-05-24 14:57:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 14:57:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 14:57:43] [INFO ] Flow matrix only has 30 transitions (discarded 58 similar events)
[2024-05-24 14:57:43] [INFO ] Invariant cache hit.
[2024-05-24 14:57:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/108 places, 88/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 28/108 places, 88/159 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-13 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:(LT s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12027 reset in 108 ms.
Product exploration explored 100000 steps with 12016 reset in 123 ms.
Computed a total of 28 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-13 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 159/159 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 149
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 91 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 91 transition count 142
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 87 transition count 142
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 81 transition count 136
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 81 transition count 136
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 77 transition count 132
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 77 transition count 132
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 73 transition count 128
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 73 transition count 128
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 69 transition count 124
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 69 transition count 124
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 84 place count 59 transition count 114
Iterating global reduction 1 with 10 rules applied. Total rules applied 94 place count 59 transition count 114
Applied a total of 94 rules in 11 ms. Remains 59 /108 variables (removed 49) and now considering 114/159 (removed 45) transitions.
[2024-05-24 14:57:44] [INFO ] Flow matrix only has 63 transitions (discarded 51 similar events)
// Phase 1: matrix 63 rows 59 cols
[2024-05-24 14:57:44] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 14:57:44] [INFO ] Implicit Places using invariants in 47 ms returned [21, 25, 29, 41]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/108 places, 114/159 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 46 transition count 105
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 46 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 45 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 45 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 44 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 44 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 43 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 43 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 42 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 42 transition count 101
Applied a total of 26 rules in 4 ms. Remains 42 /55 variables (removed 13) and now considering 101/114 (removed 13) transitions.
[2024-05-24 14:57:44] [INFO ] Flow matrix only has 44 transitions (discarded 57 similar events)
// Phase 1: matrix 44 rows 42 cols
[2024-05-24 14:57:44] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 14:57:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 14:57:44] [INFO ] Flow matrix only has 44 transitions (discarded 57 similar events)
[2024-05-24 14:57:44] [INFO ] Invariant cache hit.
[2024-05-24 14:57:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/108 places, 101/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 42/108 places, 101/159 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s22 1), p0:(AND (GEQ s25 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLFireability-15 finished in 291 ms.
All properties solved by simple procedures.
Total runtime 6491 ms.

BK_STOP 1716562665712

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S08C2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is LeafsetExtension-PT-S08C2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r241-tall-171649628300198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S08C2.tgz
mv LeafsetExtension-PT-S08C2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;