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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 01:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 01:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 01:10 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.8K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:00 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 36K 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 ShieldRVt-PT-003B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653071676671

Running Version 202205111006
[2022-05-20 18:34:38] [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 18:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:34:38] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-20 18:34:38] [INFO ] Transformed 153 places.
[2022-05-20 18:34:38] [INFO ] Transformed 153 transitions.
[2022-05-20 18:34:38] [INFO ] Found NUPN structural information;
[2022-05-20 18:34:38] [INFO ] Parsed PT model containing 153 places and 153 transitions in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-003B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 128 transition count 128
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 128 transition count 128
Applied a total of 50 rules in 45 ms. Remains 128 /153 variables (removed 25) and now considering 128/153 (removed 25) transitions.
// Phase 1: matrix 128 rows 128 cols
[2022-05-20 18:34:38] [INFO ] Computed 13 place invariants in 12 ms
[2022-05-20 18:34:39] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 128 rows 128 cols
[2022-05-20 18:34:39] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 18:34:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 128 cols
[2022-05-20 18:34:39] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 18:34:39] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/153 places, 128/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/153 places, 128/153 transitions.
Support contains 33 out of 128 places after structural reductions.
[2022-05-20 18:34:39] [INFO ] Flatten gal took : 40 ms
[2022-05-20 18:34:39] [INFO ] Flatten gal took : 19 ms
[2022-05-20 18:34:39] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 128 cols
[2022-05-20 18:34:40] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 18:34:40] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2022-05-20 18:34:40] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 18:34:40] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 30 ms to minimize.
[2022-05-20 18:34:40] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 9 ms to minimize.
[2022-05-20 18:34:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-20 18:34:40] [INFO ] After 333ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:34:40] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:34:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 88 ms returned sat
[2022-05-20 18:34:41] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 18:34:41] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2022-05-20 18:34:41] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 2 ms to minimize.
[2022-05-20 18:34:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2022-05-20 18:34:41] [INFO ] After 531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-20 18:34:41] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 128/128 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 128 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 96 transition count 96
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 64 place count 96 transition count 75
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 106 place count 75 transition count 75
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 68 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 120 place count 68 transition count 61
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 134 place count 61 transition count 61
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 180 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 38 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 183 place count 37 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 199 place count 29 transition count 43
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 29 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 28 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 27 transition count 41
Applied a total of 202 rules in 73 ms. Remains 27 /128 variables (removed 101) and now considering 41/128 (removed 87) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/128 places, 41/128 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 6160 states, properties seen :0
Probabilistic random walk after 46652 steps, saw 6160 distinct states, run finished after 184 ms. (steps per millisecond=253 ) properties seen :0
Explored full state space saw : 6160 states, properties seen :0
Exhaustive walk after 46652 steps, saw 6160 distinct states, run finished after 32 ms. (steps per millisecond=1457 ) properties seen :0
FORMULA ShieldRVt-PT-003B-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 38 stabilizing places and 38 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((F(p0)||p1))||p1)))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 120 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 118 transition count 118
Applied a total of 20 rules in 20 ms. Remains 118 /128 variables (removed 10) and now considering 118/128 (removed 10) transitions.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:42] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:42] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:42] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-20 18:34:42] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:42] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/128 places, 118/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/128 places, 118/128 transitions.
Stuttering acceptance computed with spot in 252 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 : ShieldRVt-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(EQ s71 0), p0:(OR (EQ s34 0) (EQ s43 0) (EQ s68 0))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 332 ms.
Product exploration explored 100000 steps with 33333 reset in 202 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-003B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-00 finished in 1262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 120 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 118 transition count 118
Applied a total of 20 rules in 21 ms. Remains 118 /128 variables (removed 10) and now considering 118/128 (removed 10) transitions.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:43] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:43] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:43] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:43] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:43] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:43] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/128 places, 118/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/128 places, 118/128 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s36 1)), p0:(EQ s36 0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-003B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-01 finished in 799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||G(p2))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 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 127 transition count 95
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 95 transition count 95
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 95 transition count 75
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 75 transition count 75
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 69 transition count 69
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 69 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 116 place count 69 transition count 63
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 128 place count 63 transition count 63
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 176 place count 39 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 39 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 179 place count 38 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 31 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 30 transition count 41
Applied a total of 194 rules in 18 ms. Remains 30 /128 variables (removed 98) and now considering 41/128 (removed 87) transitions.
// Phase 1: matrix 41 rows 30 cols
[2022-05-20 18:34:44] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:44] [INFO ] Implicit Places using invariants in 28 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/128 places, 41/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/128 places, 41/128 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s13 1), p0:(OR (EQ s13 1) (EQ s26 1)), p2:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-02 finished in 196 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 127 transition count 94
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 94 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 66 place count 94 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 106 place count 74 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 68 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 68 transition count 68
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 118 place count 68 transition count 62
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 62 transition count 62
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 180 place count 37 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 37 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 183 place count 36 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 199 place count 28 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 25 transition count 39
Applied a total of 202 rules in 14 ms. Remains 25 /128 variables (removed 103) and now considering 39/128 (removed 89) transitions.
// Phase 1: matrix 39 rows 25 cols
[2022-05-20 18:34:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:44] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 39 rows 25 cols
[2022-05-20 18:34:44] [INFO ] Computed 12 place invariants in 19 ms
[2022-05-20 18:34:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-20 18:34:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 25 cols
[2022-05-20 18:34:44] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-20 18:34:44] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/128 places, 39/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/128 places, 39/128 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-03 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 s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-03 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(F(p0)))&&G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 127 transition count 97
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 97 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 96 transition count 96
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 62 place count 96 transition count 75
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 104 place count 75 transition count 75
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 69 transition count 69
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 69 transition count 69
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 116 place count 69 transition count 64
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 126 place count 64 transition count 64
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 174 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 40 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 39 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 191 place count 32 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 30 transition count 42
Applied a total of 193 rules in 14 ms. Remains 30 /128 variables (removed 98) and now considering 42/128 (removed 86) transitions.
// Phase 1: matrix 42 rows 30 cols
[2022-05-20 18:34:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:45] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2022-05-20 18:34:45] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-20 18:34:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-20 18:34:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2022-05-20 18:34:45] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/128 places, 42/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/128 places, 42/128 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1 0), p0:(AND (EQ s23 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-04 finished in 225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 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 127 transition count 95
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 95 transition count 95
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 64 place count 95 transition count 74
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 106 place count 74 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 67 transition count 67
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 67 transition count 67
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 120 place count 67 transition count 60
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 134 place count 60 transition count 60
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 180 place count 37 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 37 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 183 place count 36 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 199 place count 28 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 27 transition count 41
Applied a total of 200 rules in 19 ms. Remains 27 /128 variables (removed 101) and now considering 41/128 (removed 87) transitions.
// Phase 1: matrix 41 rows 27 cols
[2022-05-20 18:34:45] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:45] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 41 rows 27 cols
[2022-05-20 18:34:45] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 18:34:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 18:34:45] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-20 18:34:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 27 cols
[2022-05-20 18:34:45] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/128 places, 41/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/128 places, 41/128 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-05 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:(EQ s19 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]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-05 finished in 218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 120 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 118 transition count 118
Applied a total of 20 rules in 12 ms. Remains 118 /128 variables (removed 10) and now considering 118/128 (removed 10) transitions.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:45] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 18:34:45] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:45] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-20 18:34:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:45] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/128 places, 118/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/128 places, 118/128 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s57 0), p1:(OR (NEQ s34 1) (NEQ s43 1) (NEQ s68 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-003B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-06 finished in 721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 1 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 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 127 transition count 95
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 95 transition count 95
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 64 place count 95 transition count 76
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 102 place count 76 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 69 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 69 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 116 place count 69 transition count 62
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 130 place count 62 transition count 62
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 178 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 179 place count 38 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 181 place count 37 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 195 place count 30 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 28 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 27 transition count 39
Applied a total of 198 rules in 22 ms. Remains 27 /128 variables (removed 101) and now considering 39/128 (removed 89) transitions.
// Phase 1: matrix 39 rows 27 cols
[2022-05-20 18:34:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:46] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 39 rows 27 cols
[2022-05-20 18:34:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-20 18:34:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 27 cols
[2022-05-20 18:34:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/128 places, 39/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/128 places, 39/128 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-07 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(X((p0 U p1)))&&p0)))&&(X(p2)||p2))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 127 transition count 98
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 98 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 97 transition count 97
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 60 place count 97 transition count 77
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 100 place count 77 transition count 77
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 71 transition count 71
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 71 transition count 71
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 112 place count 71 transition count 66
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 122 place count 66 transition count 66
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 174 place count 40 transition count 39
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 188 place count 33 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 31 transition count 42
Applied a total of 190 rules in 15 ms. Remains 31 /128 variables (removed 97) and now considering 42/128 (removed 86) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-20 18:34:46] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:46] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-20 18:34:46] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 18:34:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-20 18:34:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-20 18:34:46] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/128 places, 42/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/128 places, 42/128 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s11 1), p2:(EQ s5 1), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-08 finished in 425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(p0)))||G(X(p1)))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 121 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 119 transition count 119
Applied a total of 18 rules in 4 ms. Remains 119 /128 variables (removed 9) and now considering 119/128 (removed 9) transitions.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:46] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:46] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:46] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:46] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:46] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/128 places, 119/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/128 places, 119/128 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(EQ s54 0), p1:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 168 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-09 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((X(p0)||p1)))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 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 127 transition count 95
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 95 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 94 transition count 94
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 66 place count 94 transition count 75
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 104 place count 75 transition count 75
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 68 transition count 68
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 68 transition count 68
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 118 place count 68 transition count 63
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 128 place count 63 transition count 63
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 178 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 38 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 37 transition count 36
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 193 place count 31 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 28 transition count 37
Applied a total of 196 rules in 8 ms. Remains 28 /128 variables (removed 100) and now considering 37/128 (removed 91) transitions.
// Phase 1: matrix 37 rows 28 cols
[2022-05-20 18:34:47] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:47] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 37 rows 28 cols
[2022-05-20 18:34:47] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:47] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-20 18:34:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 28 cols
[2022-05-20 18:34:47] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 18:34:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/128 places, 37/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/128 places, 37/128 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s21 1), p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-10 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U X(X(p1)))&&F(G(p1)))))'
Support contains 1 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 127 transition count 97
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 97 transition count 97
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 60 place count 97 transition count 77
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 77 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 107 place count 70 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 114 place count 70 transition count 70
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 114 place count 70 transition count 63
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 128 place count 63 transition count 63
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 176 place count 39 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 192 place count 31 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 29 transition count 44
Applied a total of 194 rules in 9 ms. Remains 29 /128 variables (removed 99) and now considering 44/128 (removed 84) transitions.
// Phase 1: matrix 44 rows 29 cols
[2022-05-20 18:34:47] [INFO ] Computed 13 place invariants in 7 ms
[2022-05-20 18:34:47] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 44 rows 29 cols
[2022-05-20 18:34:47] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:47] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-20 18:34:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 29 cols
[2022-05-20 18:34:47] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/128 places, 44/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/128 places, 44/128 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-11 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G((G(F(X(p0)))&&X(X(p0))))||p1))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 121 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 119 transition count 119
Applied a total of 18 rules in 4 ms. Remains 119 /128 variables (removed 9) and now considering 119/128 (removed 9) transitions.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:47] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:47] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:47] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:47] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/128 places, 119/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/128 places, 119/128 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s75 0), p0:(EQ s110 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 146 ms.
Product exploration explored 100000 steps with 15 reset in 246 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/119 stabilizing places and 34/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 116 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:49] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:49] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:49] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 119/119 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/119 stabilizing places and 34/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 390 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 708 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=236 )
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19 reset in 120 ms.
Product exploration explored 100000 steps with 17 reset in 371 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 119
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 30 place count 119 transition count 132
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 43 place count 119 transition count 132
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 78 place count 119 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 119 transition count 131
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 101 place count 97 transition count 109
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 123 place count 97 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 97 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 95 transition count 107
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 95 transition count 107
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 139 place count 95 transition count 178
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 151 place count 83 transition count 154
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 163 place count 83 transition count 154
Deduced a syphon composed of 54 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 83 transition count 151
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 166 rules in 30 ms. Remains 83 /119 variables (removed 36) and now considering 151/119 (removed -32) transitions.
[2022-05-20 18:34:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 151 rows 83 cols
[2022-05-20 18:34:51] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/119 places, 151/119 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/119 places, 151/119 transitions.
Product exploration explored 100000 steps with 136 reset in 183 ms.
Product exploration explored 100000 steps with 141 reset in 234 ms.
Built C files in :
/tmp/ltsmin14180387779607616728
[2022-05-20 18:34:52] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14180387779607616728
Running compilation step : cd /tmp/ltsmin14180387779607616728;'/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 1377 ms.
Running link step : cd /tmp/ltsmin14180387779607616728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14180387779607616728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8760205934014906253.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:35:07] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:35:07] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:35:07] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:35:07] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:35:07] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:35:07] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin15070683039981457433
[2022-05-20 18:35:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15070683039981457433
Running compilation step : cd /tmp/ltsmin15070683039981457433;'/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 181 ms.
Running link step : cd /tmp/ltsmin15070683039981457433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15070683039981457433;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15781737251639087180.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:35:22] [INFO ] Flatten gal took : 9 ms
[2022-05-20 18:35:22] [INFO ] Flatten gal took : 14 ms
[2022-05-20 18:35:22] [INFO ] Time to serialize gal into /tmp/LTL5299153369869213394.gal : 2 ms
[2022-05-20 18:35:22] [INFO ] Time to serialize properties into /tmp/LTL16864832721463684013.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5299153369869213394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16864832721463684013.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5299153...267
Read 1 LTL properties
Checking formula 0 : !((G(G((G((G(F(X("(p141==0)"))))&&(X(X("(p141==0)")))))||("(p94==0)")))))
Formula 0 simplified : !G("(p94==0)" | G(GFX"(p141==0)" & XX"(p141==0)"))
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t14, t18, t23, t27, t32, t35, t41, t46, t48, t51, t55, t60, t64, t67, t73, t79, t83, ...299
Computing Next relation with stutter on 53 deadlock states
Detected timeout of ITS tools.
[2022-05-20 18:35:37] [INFO ] Flatten gal took : 12 ms
[2022-05-20 18:35:37] [INFO ] Applying decomposition
[2022-05-20 18:35:37] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1908762104429641558.txt' '-o' '/tmp/graph1908762104429641558.bin' '-w' '/tmp/graph1908762104429641558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1908762104429641558.bin' '-l' '-1' '-v' '-w' '/tmp/graph1908762104429641558.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:35:37] [INFO ] Decomposing Gal with order
[2022-05-20 18:35:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:35:37] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-20 18:35:37] [INFO ] Flatten gal took : 38 ms
[2022-05-20 18:35:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 18:35:37] [INFO ] Time to serialize gal into /tmp/LTL723609191442925722.gal : 3 ms
[2022-05-20 18:35:37] [INFO ] Time to serialize properties into /tmp/LTL9015973329683721847.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL723609191442925722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9015973329683721847.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7236091...244
Read 1 LTL properties
Checking formula 0 : !((G(G((G((G(F(X("(i11.u40.p141==0)"))))&&(X(X("(i11.u40.p141==0)")))))||("(i8.u30.p94==0)")))))
Formula 0 simplified : !G("(i8.u30.p94==0)" | G(GFX"(i11.u40.p141==0)" & XX"(i11.u40.p141==0)"))
Reverse transition relation is NOT exact ! Due to transitions t120, i0.t105, i0.u4.t110, i1.i1.t98, i1.i1.t102, i2.t88, i2.u13.t93, i3.t83, i3.u15.t79, i4....434
Computing Next relation with stutter on 53 deadlock states
50 unique states visited
0 strongly connected components in search stack
98 transitions explored
48 items max in DFS search stack
31 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.324466,32184,1,0,37054,522,1636,38617,241,1496,77114
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-003B-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-003B-LTLFireability-13 finished in 50650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U G(!p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 127 transition count 97
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 97 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 96 transition count 96
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 62 place count 96 transition count 76
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 102 place count 76 transition count 76
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 109 place count 69 transition count 69
Iterating global reduction 3 with 7 rules applied. Total rules applied 116 place count 69 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 116 place count 69 transition count 62
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 130 place count 62 transition count 62
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 176 place count 39 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 39 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 193 place count 31 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 29 transition count 43
Applied a total of 195 rules in 13 ms. Remains 29 /128 variables (removed 99) and now considering 43/128 (removed 85) transitions.
// Phase 1: matrix 43 rows 29 cols
[2022-05-20 18:35:38] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:35:38] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 43 rows 29 cols
[2022-05-20 18:35:38] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:35:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 18:35:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-20 18:35:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 43 rows 29 cols
[2022-05-20 18:35:38] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:35:38] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/128 places, 43/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/128 places, 43/128 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 1), p1:(OR (EQ s11 1) (EQ s21 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-15 finished in 213 ms.
All properties solved by simple procedures.
Total runtime 60193 ms.

BK_STOP 1653071738579

--------------------
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="ShieldRVt-PT-003B"
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 ShieldRVt-PT-003B, 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-165286026000924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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