Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716495704579

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:21:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:21:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:21:46] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-23 20:21:46] [INFO ] Transformed 268 places.
[2024-05-23 20:21:46] [INFO ] Transformed 305 transitions.
[2024-05-23 20:21:46] [INFO ] Found NUPN structural information;
[2024-05-23 20:21:46] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 200 transition count 237
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 200 transition count 237
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 161 place count 175 transition count 212
Iterating global reduction 0 with 25 rules applied. Total rules applied 186 place count 175 transition count 212
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 196 place count 165 transition count 202
Iterating global reduction 0 with 10 rules applied. Total rules applied 206 place count 165 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 208 place count 165 transition count 200
Applied a total of 208 rules in 50 ms. Remains 165 /268 variables (removed 103) and now considering 200/305 (removed 105) transitions.
// Phase 1: matrix 200 rows 165 cols
[2024-05-23 20:21:46] [INFO ] Computed 6 invariants in 14 ms
[2024-05-23 20:21:46] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-23 20:21:46] [INFO ] Invariant cache hit.
[2024-05-23 20:21:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-23 20:21:46] [INFO ] Invariant cache hit.
[2024-05-23 20:21:47] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/268 places, 200/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 165/268 places, 200/305 transitions.
Support contains 31 out of 165 places after structural reductions.
[2024-05-23 20:21:47] [INFO ] Flatten gal took : 35 ms
[2024-05-23 20:21:47] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:21:47] [INFO ] Input system was already deterministic with 200 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 20:21:48] [INFO ] Invariant cache hit.
[2024-05-23 20:21:48] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:21:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 20:21:48] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 20:21:48] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-23 20:21:48] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 5 properties in 8 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 145 edges and 165 vertex of which 20 / 165 are part of one of the 3 SCC in 3 ms
Free SCC test removed 17 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 147 transition count 161
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 127 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 127 transition count 149
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 115 transition count 149
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 86 place count 94 transition count 128
Iterating global reduction 2 with 21 rules applied. Total rules applied 107 place count 94 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 94 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 108 place count 94 transition count 125
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 92 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 88 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 88 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 88 transition count 117
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 182 place count 59 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 57 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 57 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 57 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 192 place count 55 transition count 89
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 198 place count 55 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 54 transition count 82
Applied a total of 199 rules in 46 ms. Remains 54 /165 variables (removed 111) and now considering 82/200 (removed 118) transitions.
[2024-05-23 20:21:48] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
// Phase 1: matrix 76 rows 54 cols
[2024-05-23 20:21:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:21:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 20:21:48] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-23 20:21:48] [INFO ] Invariant cache hit.
[2024-05-23 20:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:21:49] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-23 20:21:49] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 20:21:49] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-23 20:21:49] [INFO ] Invariant cache hit.
[2024-05-23 20:21:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/165 places, 82/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 54/165 places, 82/200 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s10 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 2 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-00 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 146 transition count 181
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 146 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 146 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 139 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 139 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 139 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 137 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 137 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 137 transition count 165
Applied a total of 63 rules in 14 ms. Remains 137 /165 variables (removed 28) and now considering 165/200 (removed 35) transitions.
// Phase 1: matrix 165 rows 137 cols
[2024-05-23 20:21:49] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 20:21:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-23 20:21:49] [INFO ] Invariant cache hit.
[2024-05-23 20:21:49] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-23 20:21:49] [INFO ] Invariant cache hit.
[2024-05-23 20:21:49] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/165 places, 165/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 137/165 places, 165/200 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s100 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-02 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 141 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 141 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 141 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 139 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 139 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 139 transition count 168
Applied a total of 58 rules in 16 ms. Remains 139 /165 variables (removed 26) and now considering 168/200 (removed 32) transitions.
// Phase 1: matrix 168 rows 139 cols
[2024-05-23 20:21:50] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 20:21:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 20:21:50] [INFO ] Invariant cache hit.
[2024-05-23 20:21:50] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-23 20:21:50] [INFO ] Invariant cache hit.
[2024-05-23 20:21:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/165 places, 168/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 139/165 places, 168/200 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s37 0), p0:(EQ s19 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-03 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (G(p0)||(p0&&(p1 U (G(p1)||(p1&&G(p2)))))))&&(p1||G(p2))) U !p2))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 147 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 2 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 142 transition count 158
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 124 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 123 transition count 157
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 39 place count 123 transition count 145
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 63 place count 111 transition count 145
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 85 place count 89 transition count 123
Iterating global reduction 3 with 22 rules applied. Total rules applied 107 place count 89 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 108 place count 89 transition count 121
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 110 place count 88 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 86 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 86 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 86 transition count 117
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 5 with 50 rules applied. Total rules applied 166 place count 61 transition count 92
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 58 transition count 89
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 58 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 175 place count 58 transition count 86
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 179 place count 58 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 56 transition count 80
Applied a total of 181 rules in 31 ms. Remains 56 /165 variables (removed 109) and now considering 80/200 (removed 120) transitions.
[2024-05-23 20:21:50] [INFO ] Flow matrix only has 73 transitions (discarded 7 similar events)
// Phase 1: matrix 73 rows 56 cols
[2024-05-23 20:21:50] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:21:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 20:21:50] [INFO ] Flow matrix only has 73 transitions (discarded 7 similar events)
[2024-05-23 20:21:50] [INFO ] Invariant cache hit.
[2024-05-23 20:21:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-23 20:21:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:21:51] [INFO ] Flow matrix only has 73 transitions (discarded 7 similar events)
[2024-05-23 20:21:51] [INFO ] Invariant cache hit.
[2024-05-23 20:21:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/165 places, 80/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 56/165 places, 80/200 transitions.
Stuttering acceptance computed with spot in 493 ms :[p2, true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(AND p2 p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(NEQ s49 1), p0:(NEQ s4 1), p1:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-04 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 142 transition count 157
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 123 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 123 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 112 transition count 146
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 82 place count 91 transition count 125
Iterating global reduction 2 with 21 rules applied. Total rules applied 103 place count 91 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 91 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 91 transition count 123
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 106 place count 90 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 87 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 87 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 118
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 166 place count 61 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 59 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 59 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 59 transition count 88
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 59 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 57 transition count 82
Applied a total of 178 rules in 36 ms. Remains 57 /165 variables (removed 108) and now considering 82/200 (removed 118) transitions.
[2024-05-23 20:21:51] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
// Phase 1: matrix 75 rows 57 cols
[2024-05-23 20:21:51] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 20:21:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 20:21:51] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-23 20:21:51] [INFO ] Invariant cache hit.
[2024-05-23 20:21:51] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-23 20:21:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:21:51] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-23 20:21:51] [INFO ] Invariant cache hit.
[2024-05-23 20:21:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/165 places, 82/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 57/165 places, 82/200 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(NEQ s28 1), p0:(EQ s33 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-05 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((p1&&X(p2)&&(p3 U (p4||G(p3))))))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 148 transition count 183
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 148 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 148 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 143 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 143 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 143 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 142 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 142 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 142 transition count 172
Applied a total of 51 rules in 17 ms. Remains 142 /165 variables (removed 23) and now considering 172/200 (removed 28) transitions.
// Phase 1: matrix 172 rows 142 cols
[2024-05-23 20:21:51] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 20:21:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 20:21:52] [INFO ] Invariant cache hit.
[2024-05-23 20:21:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-23 20:21:52] [INFO ] Invariant cache hit.
[2024-05-23 20:21:52] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/165 places, 172/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 142/165 places, 172/200 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1 p4) (AND (NOT p0) p1 p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p4) p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 p4) (AND p1 p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s38 0), p1:(EQ s62 0), p4:(AND (NEQ s91 1) (NEQ s38 1)), p3:(NEQ s38 1), p2:(EQ s37 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2281 reset in 171 ms.
Product exploration explored 100000 steps with 2257 reset in 168 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p4 p3 p2), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3))))), (X (OR (AND p1 p4) (AND p1 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p4) p3))), (X (NOT (AND (NOT p4) p3))), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3)))))), (X (X (OR (AND p1 p4) (AND p1 p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 267 ms. Reduced automaton from 4 states, 12 edges and 5 AP (stutter sensitive) to 4 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-23 20:21:53] [INFO ] Invariant cache hit.
[2024-05-23 20:21:53] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 20:21:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 20:21:53] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p4 p3 p2), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3))))), (X (OR (AND p1 p4) (AND p1 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p4) p3))), (X (NOT (AND (NOT p4) p3))), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (OR (NOT p1) (AND (NOT p4) (NOT p3)))))), (X (X (OR (AND p1 p4) (AND p1 p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2)))))), (G (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))))), (G (NOT (AND p1 (NOT p4) p3 (NOT p0)))), (G (NOT (OR (AND p1 p4 (NOT p0)) (AND p1 p3 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 p4) (AND p1 p3)))), (F (OR (NOT p1) (AND (NOT p4) (NOT p3)))), (F (AND p1 (NOT p4) p3)), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p0)))), (F (AND p1 (NOT p4) p3 (NOT p2))), (F (AND (NOT p4) p3)), (F (OR (AND p1 p4 (NOT p2)) (AND p1 p3 (NOT p2)))), (F (AND (NOT p4) (NOT p3)))]
Knowledge based reduction with 20 factoid took 470 ms. Reduced automaton from 4 states, 12 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 172/172 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-23 20:21:54] [INFO ] Invariant cache hit.
[2024-05-23 20:21:54] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-23 20:21:54] [INFO ] Invariant cache hit.
[2024-05-23 20:21:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-23 20:21:54] [INFO ] Invariant cache hit.
[2024-05-23 20:21:54] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 142/142 places, 172/172 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p4 p2), (X (OR (AND p1 p3) (AND p1 p4))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4))))), (X (X (OR (AND p1 p3) (AND p1 p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4)))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 4 states, 9 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-05-23 20:21:55] [INFO ] Invariant cache hit.
[2024-05-23 20:21:55] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:21:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 20:21:55] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:21:55] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 20:21:55] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p3 p4 p2), (X (OR (AND p1 p3) (AND p1 p4))), (X (NOT (AND p1 p3 (NOT p4)))), (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4))))), (X (X (OR (AND p1 p3) (AND p1 p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (OR (NOT p1) (AND (NOT p3) (NOT p4)))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 p3 (NOT p4))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p4) (NOT p2))), (F (NOT p0)), (F (NOT (OR (AND p1 p3) (AND p1 p4)))), (F (OR (NOT p1) (AND (NOT p3) (NOT p4)))), (F (AND p3 (NOT p4)))]
Knowledge based reduction with 11 factoid took 378 ms. Reduced automaton from 4 states, 9 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (AND (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 2266 reset in 102 ms.
Product exploration explored 100000 steps with 2250 reset in 201 ms.
Built C files in :
/tmp/ltsmin11762908723211776318
[2024-05-23 20:21:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11762908723211776318
Running compilation step : cd /tmp/ltsmin11762908723211776318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin11762908723211776318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11762908723211776318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5837878514503696578.hoa' '--buchi-type=spotba'
LTSmin run took 2891 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-06 finished in 8786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (F(p1)&&X(X(G(p2))))))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 156
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 122 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 110 transition count 144
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 85 place count 90 transition count 124
Iterating global reduction 2 with 20 rules applied. Total rules applied 105 place count 90 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 90 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 88 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 88 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 88 transition count 119
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 166 place count 61 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 59 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 59 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 59 transition count 88
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 59 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 57 transition count 82
Applied a total of 178 rules in 19 ms. Remains 57 /165 variables (removed 108) and now considering 82/200 (removed 118) transitions.
[2024-05-23 20:22:00] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
// Phase 1: matrix 76 rows 57 cols
[2024-05-23 20:22:00] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:22:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 20:22:00] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-23 20:22:00] [INFO ] Invariant cache hit.
[2024-05-23 20:22:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:22:00] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-23 20:22:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:22:00] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-05-23 20:22:00] [INFO ] Invariant cache hit.
[2024-05-23 20:22:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/165 places, 82/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 57/165 places, 82/200 transitions.
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 5}, { cond=true, acceptance={1} source=2 dest: 6}, { cond=p0, acceptance={0, 1} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 5}, { cond=p0, acceptance={0, 1} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 6}, { cond=(NOT p2), acceptance={1} source=5 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s54 1), p0:(EQ s50 1), p2:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-07 finished in 690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 156
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 122 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 110 transition count 144
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 88 place count 87 transition count 121
Iterating global reduction 2 with 23 rules applied. Total rules applied 111 place count 87 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 87 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 84 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 84 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 84 transition count 114
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 173 place count 58 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 55 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 55 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 182 place count 55 transition count 82
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 186 place count 55 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 53 transition count 76
Applied a total of 188 rules in 23 ms. Remains 53 /165 variables (removed 112) and now considering 76/200 (removed 124) transitions.
[2024-05-23 20:22:01] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
// Phase 1: matrix 70 rows 53 cols
[2024-05-23 20:22:01] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 20:22:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 20:22:01] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2024-05-23 20:22:01] [INFO ] Invariant cache hit.
[2024-05-23 20:22:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:22:01] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-23 20:22:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:22:01] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2024-05-23 20:22:01] [INFO ] Invariant cache hit.
[2024-05-23 20:22:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/165 places, 76/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 53/165 places, 76/200 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s52 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 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-08 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Graph (trivial) has 150 edges and 165 vertex of which 26 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 156
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 122 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 110 transition count 144
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 87 place count 88 transition count 122
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 88 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 88 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 110 place count 88 transition count 120
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 112 place count 87 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 85 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 85 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 85 transition count 116
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 170 place count 59 transition count 90
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 56 transition count 87
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 56 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 179 place count 56 transition count 84
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 56 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 54 transition count 78
Applied a total of 185 rules in 26 ms. Remains 54 /165 variables (removed 111) and now considering 78/200 (removed 122) transitions.
[2024-05-23 20:22:01] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 54 cols
[2024-05-23 20:22:01] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:22:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 20:22:01] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-23 20:22:01] [INFO ] Invariant cache hit.
[2024-05-23 20:22:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-23 20:22:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:22:01] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-23 20:22:01] [INFO ] Invariant cache hit.
[2024-05-23 20:22:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/165 places, 78/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 54/165 places, 78/200 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s50 0)], 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 5685 steps with 518 reset in 45 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-09 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))&&p0))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 149 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 149 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 149 transition count 183
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 143 transition count 177
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 143 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 143 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 141 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 141 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 141 transition count 169
Applied a total of 55 rules in 10 ms. Remains 141 /165 variables (removed 24) and now considering 169/200 (removed 31) transitions.
// Phase 1: matrix 169 rows 141 cols
[2024-05-23 20:22:02] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 20:22:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 20:22:02] [INFO ] Invariant cache hit.
[2024-05-23 20:22:02] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-23 20:22:02] [INFO ] Invariant cache hit.
[2024-05-23 20:22:02] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/165 places, 169/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 141/165 places, 169/200 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s119 1), p0:(AND (EQ s17 1) (OR (EQ s76 1) (EQ s119 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 166 steps with 3 reset in 5 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-10 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))&&G(p2))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 140 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 140 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 140 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 139 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 139 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 139 transition count 168
Applied a total of 58 rules in 8 ms. Remains 139 /165 variables (removed 26) and now considering 168/200 (removed 32) transitions.
// Phase 1: matrix 168 rows 139 cols
[2024-05-23 20:22:02] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 20:22:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 20:22:02] [INFO ] Invariant cache hit.
[2024-05-23 20:22:02] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-23 20:22:02] [INFO ] Invariant cache hit.
[2024-05-23 20:22:02] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/165 places, 168/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 139/165 places, 168/200 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(EQ s29 1), p2:(EQ s128 1), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-11 finished in 534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(p1))))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 182
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 140 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 140 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 140 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 138 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 138 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 138 transition count 166
Applied a total of 61 rules in 12 ms. Remains 138 /165 variables (removed 27) and now considering 166/200 (removed 34) transitions.
// Phase 1: matrix 166 rows 138 cols
[2024-05-23 20:22:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:22:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-23 20:22:03] [INFO ] Invariant cache hit.
[2024-05-23 20:22:03] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-23 20:22:03] [INFO ] Invariant cache hit.
[2024-05-23 20:22:03] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/165 places, 166/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 138/165 places, 166/200 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(EQ s133 1), p0:(EQ s71 1)], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-14 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(p1&&G((G(F(p2)) U p2))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 148 transition count 183
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 148 transition count 183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 142 transition count 177
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 142 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 142 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 140 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 140 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 140 transition count 170
Applied a total of 55 rules in 7 ms. Remains 140 /165 variables (removed 25) and now considering 170/200 (removed 30) transitions.
// Phase 1: matrix 170 rows 140 cols
[2024-05-23 20:22:03] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 20:22:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 20:22:03] [INFO ] Invariant cache hit.
[2024-05-23 20:22:03] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-23 20:22:03] [INFO ] Invariant cache hit.
[2024-05-23 20:22:03] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/165 places, 170/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 140/165 places, 170/200 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 7}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 8}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (EQ s11 0) (EQ s91 0) (EQ s126 0)), p0:(EQ s124 1), p2:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-15 finished in 622 ms.
All properties solved by simple procedures.
Total runtime 18073 ms.

BK_STOP 1716495725649

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-04b, 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 r197-tall-171640624700008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 ;