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.r222-tall-165286025400556.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 ShieldPPPt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025400556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 29 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 37K May 10 09:34 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 ShieldPPPt-PT-002B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653014672506

Running Version 202205111006
[2022-05-20 02:44:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-20 02:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 02:44:33] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-20 02:44:33] [INFO ] Transformed 159 places.
[2022-05-20 02:44:33] [INFO ] Transformed 145 transitions.
[2022-05-20 02:44:33] [INFO ] Found NUPN structural information;
[2022-05-20 02:44:33] [INFO ] Parsed PT model containing 159 places and 145 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-002B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 144 transition count 130
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 144 transition count 130
Applied a total of 30 rules in 33 ms. Remains 144 /159 variables (removed 15) and now considering 130/145 (removed 15) transitions.
// Phase 1: matrix 130 rows 144 cols
[2022-05-20 02:44:34] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 02:44:34] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 130 rows 144 cols
[2022-05-20 02:44:34] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-20 02:44:34] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 130 rows 144 cols
[2022-05-20 02:44:34] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-20 02:44:34] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/159 places, 130/145 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/159 places, 130/145 transitions.
Support contains 28 out of 144 places after structural reductions.
[2022-05-20 02:44:34] [INFO ] Flatten gal took : 30 ms
[2022-05-20 02:44:34] [INFO ] Flatten gal took : 14 ms
[2022-05-20 02:44:34] [INFO ] Input system was already deterministic with 130 transitions.
Finished random walk after 372 steps, including 0 resets, run visited all 24 properties in 85 ms. (steps per millisecond=4 )
FORMULA ShieldPPPt-PT-002B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 35 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(G(F(p0)))))&&F(F(p1))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 143 transition count 95
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 109 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 108 transition count 93
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 71 place count 108 transition count 81
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 96 transition count 81
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 92 transition count 77
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 92 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 103 place count 92 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 90 transition count 75
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 169 place count 59 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 179 place count 54 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 52 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 51 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 182 place count 51 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 186 place count 49 transition count 40
Applied a total of 186 rules in 46 ms. Remains 49 /144 variables (removed 95) and now considering 40/130 (removed 90) transitions.
// Phase 1: matrix 40 rows 49 cols
[2022-05-20 02:44:35] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants in 53 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/144 places, 40/130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 38
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 45 cols
[2022-05-20 02:44:35] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 38 rows 45 cols
[2022-05-20 02:44:35] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/144 places, 38/130 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/144 places, 38/130 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s40 1), p1:(EQ s15 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 84588 steps with 1825 reset in 230 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-00 finished in 794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 143 transition count 95
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 109 transition count 93
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 108 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 107 transition count 92
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 73 place count 107 transition count 82
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 93 place count 97 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 94 transition count 79
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 94 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 99 place count 94 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 105 place count 91 transition count 76
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 167 place count 60 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 177 place count 55 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 53 transition count 43
Applied a total of 179 rules in 25 ms. Remains 53 /144 variables (removed 91) and now considering 43/130 (removed 87) transitions.
// Phase 1: matrix 43 rows 53 cols
[2022-05-20 02:44:35] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants in 52 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/144 places, 43/130 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 52 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 41
Applied a total of 4 rules in 2 ms. Remains 50 /52 variables (removed 2) and now considering 41/43 (removed 2) transitions.
// Phase 1: matrix 41 rows 50 cols
[2022-05-20 02:44:35] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants in 41 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/144 places, 41/130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 46 transition count 39
Applied a total of 4 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 39/41 (removed 2) transitions.
// Phase 1: matrix 39 rows 46 cols
[2022-05-20 02:44:35] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 02:44:35] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 39 rows 46 cols
[2022-05-20 02:44:35] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 02:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 02:44:36] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 46/144 places, 39/130 transitions.
Finished structural reductions, in 3 iterations. Remains : 46/144 places, 39/130 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-01 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:(OR (NEQ s21 1) (EQ s39 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 1367 reset in 186 ms.
Stack based approach found an accepted trace after 14179 steps with 197 reset with depth 32 and stack size 32 in 43 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-01 finished in 612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(F(p0)) U p1))&&G(p2))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 143 transition count 95
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 109 transition count 93
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 108 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 107 transition count 92
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 73 place count 107 transition count 80
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 97 place count 95 transition count 80
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 101 place count 91 transition count 76
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 91 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 105 place count 91 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 109 place count 89 transition count 74
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 167 place count 60 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 177 place count 55 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 53 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 52 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 180 place count 52 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 184 place count 50 transition count 41
Applied a total of 184 rules in 20 ms. Remains 50 /144 variables (removed 94) and now considering 41/130 (removed 89) transitions.
// Phase 1: matrix 41 rows 50 cols
[2022-05-20 02:44:36] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 02:44:36] [INFO ] Implicit Places using invariants in 36 ms returned [33, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/144 places, 41/130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 46 transition count 39
Applied a total of 4 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 39/41 (removed 2) transitions.
// Phase 1: matrix 39 rows 46 cols
[2022-05-20 02:44:36] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-20 02:44:36] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 39 rows 46 cols
[2022-05-20 02:44:36] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 02:44:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 02:44:36] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/144 places, 39/130 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/144 places, 39/130 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s25 1), p1:(EQ s16 1), p0:(OR (EQ s16 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 40400 steps with 1 reset in 86 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-02 finished in 525 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(X(F(p0)))&&G(p1)))&&X(G(p2))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 136 transition count 122
Applied a total of 16 rules in 10 ms. Remains 136 /144 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 136 cols
[2022-05-20 02:44:36] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 122 rows 136 cols
[2022-05-20 02:44:37] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 136 cols
[2022-05-20 02:44:37] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:37] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/144 places, 122/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/144 places, 122/130 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s81 1) (EQ s116 1)), p1:(EQ s17 0), p0:(AND (EQ s129 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-03 finished in 490 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 143 transition count 95
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 109 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 108 transition count 93
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 71 place count 108 transition count 81
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 96 transition count 81
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 91 transition count 76
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 91 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 105 place count 91 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 88 transition count 73
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 171 place count 58 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 179 place count 54 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 52 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 51 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 182 place count 51 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 186 place count 49 transition count 39
Applied a total of 186 rules in 27 ms. Remains 49 /144 variables (removed 95) and now considering 39/130 (removed 91) transitions.
// Phase 1: matrix 39 rows 49 cols
[2022-05-20 02:44:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants in 38 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/144 places, 39/130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 37
Applied a total of 4 rules in 1 ms. Remains 45 /47 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 45 cols
[2022-05-20 02:44:37] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 37 rows 45 cols
[2022-05-20 02:44:37] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/144 places, 37/130 transitions.
Finished structural reductions, in 2 iterations. Remains : 45/144 places, 37/130 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22 reset in 170 ms.
Stack based approach found an accepted trace after 172 steps with 0 reset with depth 173 and stack size 173 in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-04 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(X(p0))||(F(p1)&&p2)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 124
Applied a total of 12 rules in 6 ms. Remains 138 /144 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 138 cols
[2022-05-20 02:44:37] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 124 rows 138 cols
[2022-05-20 02:44:37] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 02:44:37] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 138 cols
[2022-05-20 02:44:38] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:38] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/144 places, 124/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/144 places, 124/130 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s111 0), p1:(EQ s111 1), p0:(EQ s6 0)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3230 reset in 172 ms.
Product exploration explored 100000 steps with 3247 reset in 117 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Computed a total of 33 stabilizing places and 33 stable transitions
Detected a total of 33/138 stabilizing places and 33/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 520 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 40 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 647 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 138 cols
[2022-05-20 02:44:40] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 02:44:40] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 124 rows 138 cols
[2022-05-20 02:44:40] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:40] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 138 cols
[2022-05-20 02:44:40] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:40] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 124/124 transitions.
Computed a total of 33 stabilizing places and 33 stable transitions
Computed a total of 33 stabilizing places and 33 stable transitions
Detected a total of 33/138 stabilizing places and 33/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 638 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 36 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 686 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration explored 100000 steps with 3206 reset in 114 ms.
Stack based approach found an accepted trace after 9563 steps with 306 reset with depth 47 and stack size 47 in 10 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-05 finished in 5228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U (!X((p1 U G(!p0)))||p2)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 137 transition count 123
Applied a total of 14 rules in 8 ms. Remains 137 /144 variables (removed 7) and now considering 123/130 (removed 7) transitions.
// Phase 1: matrix 123 rows 137 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 123 rows 137 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 137 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:43] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/144 places, 123/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/144 places, 123/130 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR p0 p2), true, p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), p0]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s48 1), p2:(EQ s106 1), p1:(AND (EQ s19 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-10 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((X(p0)&&p1))||X(p1))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 137 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 135 transition count 121
Applied a total of 18 rules in 8 ms. Remains 135 /144 variables (removed 9) and now considering 121/130 (removed 9) transitions.
// Phase 1: matrix 121 rows 135 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 121 rows 135 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 121 rows 135 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 02:44:43] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/144 places, 121/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/144 places, 121/130 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s11 1), p0:(EQ s96 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-11 finished in 338 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 144 transition count 98
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 112 transition count 96
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 111 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 110 transition count 95
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 69 place count 110 transition count 83
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 93 place count 98 transition count 83
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 97 place count 94 transition count 79
Iterating global reduction 4 with 4 rules applied. Total rules applied 101 place count 94 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 101 place count 94 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 107 place count 91 transition count 76
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 171 place count 59 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 181 place count 54 transition count 44
Applied a total of 181 rules in 19 ms. Remains 54 /144 variables (removed 90) and now considering 44/130 (removed 86) transitions.
// Phase 1: matrix 44 rows 54 cols
[2022-05-20 02:44:43] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants in 43 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/144 places, 44/130 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 53 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 42
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 51 cols
[2022-05-20 02:44:43] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants in 38 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/144 places, 42/130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 40
Applied a total of 4 rules in 2 ms. Remains 47 /49 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 47 cols
[2022-05-20 02:44:43] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 02:44:43] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 40 rows 47 cols
[2022-05-20 02:44:43] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 02:44:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 02:44:44] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 47/144 places, 40/130 transitions.
Finished structural reductions, in 3 iterations. Remains : 47/144 places, 40/130 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s28 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8 reset in 158 ms.
Product exploration explored 100000 steps with 6 reset in 175 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/47 stabilizing places and 4/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 47 cols
[2022-05-20 02:44:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 02:44:44] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 40 rows 47 cols
[2022-05-20 02:44:44] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 02:44:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 02:44:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-20 02:44:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 47 cols
[2022-05-20 02:44:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 02:44:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/47 places, 40/40 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/47 stabilizing places and 4/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 147 ms.
Product exploration explored 100000 steps with 7 reset in 190 ms.
Built C files in :
/tmp/ltsmin9647885357184489204
[2022-05-20 02:44:45] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 02:44:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 02:44:45] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 02:44:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 02:44:45] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 02:44:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 02:44:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9647885357184489204
Running compilation step : cd /tmp/ltsmin9647885357184489204;'/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 212 ms.
Running link step : cd /tmp/ltsmin9647885357184489204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9647885357184489204;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3749728041548444821.hoa' '--buchi-type=spotba'
LTSmin run took 2436 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-002B-LTLFireability-14 finished in 4631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)||p1)))||(G(p2)&&F(p3))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 136 transition count 122
Applied a total of 16 rules in 5 ms. Remains 136 /144 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 136 cols
[2022-05-20 02:44:48] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 02:44:48] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 122 rows 136 cols
[2022-05-20 02:44:48] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 02:44:48] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 136 cols
[2022-05-20 02:44:48] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 02:44:48] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/144 places, 122/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/144 places, 122/130 transitions.
Stuttering acceptance computed with spot in 476 ms :[true, (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p3 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 11}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 11}], [{ cond=(NOT p2), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 9}, { cond=(AND p2 p3), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p2 p3), acceptance={} source=9 dest: 3}, { cond=(NOT p2), acceptance={} source=9 dest: 12}], [{ cond=p2, acceptance={} source=10 dest: 3}, { cond=(NOT p2), acceptance={} source=10 dest: 12}], [{ cond=(NOT p0), acceptance={} source=11 dest: 0}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 11}]], initial=7, aps=[p2:(EQ s114 0), p3:(OR (EQ s88 0) (EQ s126 0)), p1:(EQ s62 1), p0:(AND (EQ s19 1) (EQ s44 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-15 finished in 699 ms.
All properties solved by simple procedures.
Total runtime 15513 ms.

BK_STOP 1653014689272

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldPPPt-PT-002B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPt-PT-002B, 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 r222-tall-165286025400556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B 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 ;