Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478200388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DES-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478200388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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 DES-PT-02b-LTLFireability-00
FORMULA_NAME DES-PT-02b-LTLFireability-01
FORMULA_NAME DES-PT-02b-LTLFireability-02
FORMULA_NAME DES-PT-02b-LTLFireability-03
FORMULA_NAME DES-PT-02b-LTLFireability-04
FORMULA_NAME DES-PT-02b-LTLFireability-05
FORMULA_NAME DES-PT-02b-LTLFireability-06
FORMULA_NAME DES-PT-02b-LTLFireability-07
FORMULA_NAME DES-PT-02b-LTLFireability-08
FORMULA_NAME DES-PT-02b-LTLFireability-09
FORMULA_NAME DES-PT-02b-LTLFireability-10
FORMULA_NAME DES-PT-02b-LTLFireability-11
FORMULA_NAME DES-PT-02b-LTLFireability-12
FORMULA_NAME DES-PT-02b-LTLFireability-13
FORMULA_NAME DES-PT-02b-LTLFireability-14
FORMULA_NAME DES-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678250076836

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-02b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:34:38] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-08 04:34:38] [INFO ] Transformed 288 places.
[2023-03-08 04:34:38] [INFO ] Transformed 239 transitions.
[2023-03-08 04:34:38] [INFO ] Found NUPN structural information;
[2023-03-08 04:34:38] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-02b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 268 transition count 222
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 268 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 261 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 261 transition count 215
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 261 transition count 211
Applied a total of 55 rules in 49 ms. Remains 261 /288 variables (removed 27) and now considering 211/239 (removed 28) transitions.
// Phase 1: matrix 211 rows 261 cols
[2023-03-08 04:34:38] [INFO ] Computed 62 place invariants in 25 ms
[2023-03-08 04:34:38] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-08 04:34:38] [INFO ] Invariant cache hit.
[2023-03-08 04:34:39] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 667 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/288 places, 211/239 transitions.
Applied a total of 0 rules in 8 ms. Remains 260 /260 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 725 ms. Remains : 260/288 places, 211/239 transitions.
Support contains 39 out of 260 places after structural reductions.
[2023-03-08 04:34:39] [INFO ] Flatten gal took : 42 ms
[2023-03-08 04:34:39] [INFO ] Flatten gal took : 16 ms
[2023-03-08 04:34:39] [INFO ] Input system was already deterministic with 211 transitions.
Support contains 34 out of 260 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 28) seen :27
Finished Best-First random walk after 2462 steps, including 3 resets, run visited all 1 properties in 7 ms. (steps per millisecond=351 )
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 253 transition count 190
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 237 transition count 190
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 237 transition count 180
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 227 transition count 180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 218 transition count 171
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 218 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 218 transition count 167
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 213 transition count 162
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 213 transition count 162
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 91 place count 213 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 93 place count 212 transition count 155
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 93 place count 212 transition count 152
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 99 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 247 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 251 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 130 transition count 78
Applied a total of 254 rules in 62 ms. Remains 130 /260 variables (removed 130) and now considering 78/211 (removed 133) transitions.
// Phase 1: matrix 78 rows 130 cols
[2023-03-08 04:34:40] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:34:40] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 04:34:40] [INFO ] Invariant cache hit.
[2023-03-08 04:34:40] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 04:34:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:40] [INFO ] Invariant cache hit.
[2023-03-08 04:34:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/260 places, 78/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 130/260 places, 78/211 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s49 0) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8111 reset in 413 ms.
Product exploration explored 100000 steps with 8123 reset in 271 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 04:34:41] [INFO ] Invariant cache hit.
[2023-03-08 04:34:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:34:41] [INFO ] Invariant cache hit.
[2023-03-08 04:34:41] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 04:34:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:41] [INFO ] Invariant cache hit.
[2023-03-08 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8187 reset in 222 ms.
Product exploration explored 100000 steps with 8131 reset in 209 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 04:34:42] [INFO ] Invariant cache hit.
[2023-03-08 04:34:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 04:34:43] [INFO ] Invariant cache hit.
[2023-03-08 04:34:43] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-08 04:34:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:43] [INFO ] Invariant cache hit.
[2023-03-08 04:34:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 130/130 places, 78/78 transitions.
Treatment of property DES-PT-02b-LTLFireability-00 finished in 3315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 253 transition count 189
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 226 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 217 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 217 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 217 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 212 transition count 161
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 212 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 93 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 211 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 95 place count 211 transition count 152
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 99 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 247 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 251 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 130 transition count 78
Applied a total of 254 rules in 42 ms. Remains 130 /260 variables (removed 130) and now considering 78/211 (removed 133) transitions.
// Phase 1: matrix 78 rows 130 cols
[2023-03-08 04:34:43] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:34:43] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:34:43] [INFO ] Invariant cache hit.
[2023-03-08 04:34:43] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 04:34:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:43] [INFO ] Invariant cache hit.
[2023-03-08 04:34:43] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/260 places, 78/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 130/260 places, 78/211 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s17 0), p0:(AND (EQ s78 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5017 reset in 277 ms.
Product exploration explored 100000 steps with 4992 reset in 221 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 8 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 04:34:44] [INFO ] Invariant cache hit.
[2023-03-08 04:34:44] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 04:34:44] [INFO ] Invariant cache hit.
[2023-03-08 04:34:45] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-08 04:34:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:45] [INFO ] Invariant cache hit.
[2023-03-08 04:34:45] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5060 reset in 200 ms.
Product exploration explored 100000 steps with 5002 reset in 219 ms.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 04:34:46] [INFO ] Invariant cache hit.
[2023-03-08 04:34:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 04:34:46] [INFO ] Invariant cache hit.
[2023-03-08 04:34:46] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 04:34:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:34:46] [INFO ] Invariant cache hit.
[2023-03-08 04:34:46] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 130/130 places, 78/78 transitions.
Treatment of property DES-PT-02b-LTLFireability-01 finished in 3516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 253 transition count 191
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 238 transition count 191
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 238 transition count 180
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 227 transition count 180
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 219 transition count 172
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 219 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 219 transition count 169
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 77 place count 214 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 214 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 88 place count 214 transition count 158
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 213 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 90 place count 213 transition count 155
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 94 place count 211 transition count 155
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 240 place count 138 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 246 place count 135 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 133 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 132 transition count 83
Applied a total of 249 rules in 31 ms. Remains 132 /260 variables (removed 128) and now considering 83/211 (removed 128) transitions.
// Phase 1: matrix 83 rows 132 cols
[2023-03-08 04:34:46] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:34:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:34:46] [INFO ] Invariant cache hit.
[2023-03-08 04:34:47] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 04:34:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:47] [INFO ] Invariant cache hit.
[2023-03-08 04:34:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/260 places, 83/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 132/260 places, 83/211 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s105 1), p0:(OR (NEQ s16 1) (NEQ s107 1) (AND (EQ s1 1) (EQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5796 reset in 194 ms.
Product exploration explored 100000 steps with 5790 reset in 218 ms.
Computed a total of 26 stabilizing places and 21 stable transitions
Computed a total of 26 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT 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 : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 56 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT 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 : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-08 04:34:48] [INFO ] Invariant cache hit.
[2023-03-08 04:34:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:34:48] [INFO ] Invariant cache hit.
[2023-03-08 04:34:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 04:34:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:48] [INFO ] Invariant cache hit.
[2023-03-08 04:34:48] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 132/132 places, 83/83 transitions.
Computed a total of 26 stabilizing places and 21 stable transitions
Computed a total of 26 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1156 steps, including 56 resets, run visited all 2 properties in 10 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5733 reset in 199 ms.
Product exploration explored 100000 steps with 5750 reset in 219 ms.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-08 04:34:49] [INFO ] Invariant cache hit.
[2023-03-08 04:34:49] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 04:34:49] [INFO ] Invariant cache hit.
[2023-03-08 04:34:49] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-08 04:34:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:34:49] [INFO ] Invariant cache hit.
[2023-03-08 04:34:49] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 132/132 places, 83/83 transitions.
Treatment of property DES-PT-02b-LTLFireability-03 finished in 3113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 248 transition count 199
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 248 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 248 transition count 195
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 244 transition count 191
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 244 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 244 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 243 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 243 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 243 transition count 185
Applied a total of 43 rules in 11 ms. Remains 243 /260 variables (removed 17) and now considering 185/211 (removed 26) transitions.
// Phase 1: matrix 185 rows 243 cols
[2023-03-08 04:34:49] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-08 04:34:50] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 04:34:50] [INFO ] Invariant cache hit.
[2023-03-08 04:34:50] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-08 04:34:50] [INFO ] Invariant cache hit.
[2023-03-08 04:34:50] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/260 places, 185/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 243/260 places, 185/211 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s4 1) (EQ s99 1)) (AND (EQ s40 1) (NOT (AND (EQ s4 1) (EQ s99 1))))), p0:(NEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25036 reset in 167 ms.
Product exploration explored 100000 steps with 24993 reset in 172 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 365 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 04:34:51] [INFO ] Invariant cache hit.
[2023-03-08 04:34:51] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 04:34:51] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-08 04:34:51] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 04:34:51] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2023-03-08 04:34:51] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-08 04:34:52] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 04:34:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2023-03-08 04:34:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-08 04:34:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-08 04:34:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2023-03-08 04:34:52] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2023-03-08 04:34:52] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2023-03-08 04:34:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 275 ms
[2023-03-08 04:34:52] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 04:34:52] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 238 transition count 163
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 221 transition count 163
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 221 transition count 153
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 211 transition count 153
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 207 place count 136 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 215 place count 132 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 132 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 131 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 131 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 130 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 129 transition count 85
Applied a total of 220 rules in 24 ms. Remains 129 /243 variables (removed 114) and now considering 85/185 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 129/243 places, 85/185 transitions.
Finished random walk after 1347 steps, including 63 resets, run visited all 1 properties in 6 ms. (steps per millisecond=224 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 520 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
[2023-03-08 04:34:53] [INFO ] Invariant cache hit.
[2023-03-08 04:34:53] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 04:34:53] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-08 04:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:34:53] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-08 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:34:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 04:34:53] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-08 04:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:34:53] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-08 04:34:53] [INFO ] Computed and/alt/rep : 183/311/183 causal constraints (skipped 1 transitions) in 14 ms.
[2023-03-08 04:34:54] [INFO ] Added : 166 causal constraints over 34 iterations in 729 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 04:34:54] [INFO ] Invariant cache hit.
[2023-03-08 04:34:54] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 04:34:54] [INFO ] Invariant cache hit.
[2023-03-08 04:34:55] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-08 04:34:55] [INFO ] Invariant cache hit.
[2023-03-08 04:34:55] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 243/243 places, 185/185 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Finished random walk after 230 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 8 factoid took 339 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
[2023-03-08 04:34:56] [INFO ] Invariant cache hit.
[2023-03-08 04:34:56] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 04:34:56] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-08 04:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:34:56] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-08 04:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:34:56] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 04:34:56] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-08 04:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:34:57] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-08 04:34:57] [INFO ] Computed and/alt/rep : 183/311/183 causal constraints (skipped 1 transitions) in 16 ms.
[2023-03-08 04:34:57] [INFO ] Added : 166 causal constraints over 34 iterations in 704 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33320 reset in 178 ms.
Product exploration explored 100000 steps with 33376 reset in 180 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 238 transition count 182
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 16 place count 238 transition count 184
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 238 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 233 transition count 179
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 233 transition count 179
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 110 place count 233 transition count 182
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 223 transition count 172
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 223 transition count 172
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 223 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 221 transition count 194
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 221 transition count 194
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 46 ms. Remains 221 /243 variables (removed 22) and now considering 194/185 (removed -9) transitions.
[2023-03-08 04:34:58] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 194 rows 221 cols
[2023-03-08 04:34:58] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 04:34:58] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/243 places, 194/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 221/243 places, 194/185 transitions.
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
// Phase 1: matrix 185 rows 243 cols
[2023-03-08 04:34:58] [INFO ] Computed 61 place invariants in 15 ms
[2023-03-08 04:34:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 04:34:58] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-08 04:34:59] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 243/243 places, 185/185 transitions.
Treatment of property DES-PT-02b-LTLFireability-04 finished in 9276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 249 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 245 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 245 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 245 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 244 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 244 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 244 transition count 187
Applied a total of 40 rules in 23 ms. Remains 244 /260 variables (removed 16) and now considering 187/211 (removed 24) transitions.
// Phase 1: matrix 187 rows 244 cols
[2023-03-08 04:34:59] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-08 04:34:59] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-08 04:34:59] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-08 04:34:59] [INFO ] Invariant cache hit.
[2023-03-08 04:34:59] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/260 places, 187/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 244/260 places, 187/211 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s85 0)), p1:(AND (EQ s78 1) (EQ s85 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-05 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 248 transition count 199
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 248 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 248 transition count 195
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 243 transition count 190
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 243 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 243 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 242 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 242 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 242 transition count 183
Applied a total of 46 rules in 19 ms. Remains 242 /260 variables (removed 18) and now considering 183/211 (removed 28) transitions.
// Phase 1: matrix 183 rows 242 cols
[2023-03-08 04:34:59] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 04:35:00] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:35:00] [INFO ] Invariant cache hit.
[2023-03-08 04:35:00] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-08 04:35:00] [INFO ] Invariant cache hit.
[2023-03-08 04:35:00] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/260 places, 183/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 242/260 places, 183/211 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s210 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-07 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||F(G(p1))))&&(X(p1)||(p2 U (p3||G(p2))))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 249 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 245 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 245 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 245 transition count 189
Applied a total of 37 rules in 12 ms. Remains 245 /260 variables (removed 15) and now considering 189/211 (removed 22) transitions.
// Phase 1: matrix 189 rows 245 cols
[2023-03-08 04:35:00] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-08 04:35:00] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 04:35:00] [INFO ] Invariant cache hit.
[2023-03-08 04:35:00] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 04:35:00] [INFO ] Invariant cache hit.
[2023-03-08 04:35:00] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/260 places, 189/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 245/260 places, 189/211 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : DES-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (NEQ s34 1) (NEQ s51 1)), p2:(NEQ s51 1), p1:(EQ s29 1), p0:(AND (EQ s79 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-08 finished in 677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 249 transition count 196
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 245 transition count 192
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 245 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 245 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 244 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 244 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 244 transition count 186
Applied a total of 41 rules in 19 ms. Remains 244 /260 variables (removed 16) and now considering 186/211 (removed 25) transitions.
// Phase 1: matrix 186 rows 244 cols
[2023-03-08 04:35:01] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 04:35:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 04:35:01] [INFO ] Invariant cache hit.
[2023-03-08 04:35:01] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-08 04:35:01] [INFO ] Invariant cache hit.
[2023-03-08 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/260 places, 186/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 244/260 places, 186/211 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s23 1), p0:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-09 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 253 transition count 189
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 226 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 217 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 217 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 217 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 212 transition count 161
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 212 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 93 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 211 transition count 154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 95 place count 211 transition count 151
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 101 place count 208 transition count 151
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 251 place count 133 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 255 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 128 transition count 76
Applied a total of 258 rules in 29 ms. Remains 128 /260 variables (removed 132) and now considering 76/211 (removed 135) transitions.
// Phase 1: matrix 76 rows 128 cols
[2023-03-08 04:35:01] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:35:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-08 04:35:01] [INFO ] Invariant cache hit.
[2023-03-08 04:35:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 04:35:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:35:01] [INFO ] Invariant cache hit.
[2023-03-08 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/260 places, 76/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 128/260 places, 76/211 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s45 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]]
Product exploration explored 100000 steps with 22252 reset in 144 ms.
Product exploration explored 100000 steps with 22296 reset in 158 ms.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Detected a total of 25/128 stabilizing places and 20/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-08 04:35:02] [INFO ] Invariant cache hit.
[2023-03-08 04:35:02] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:35:02] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 04:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:35:02] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 04:35:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:35:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:35:02] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 04:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:35:02] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-08 04:35:02] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2023-03-08 04:35:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-08 04:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2023-03-08 04:35:02] [INFO ] Computed and/alt/rep : 65/187/65 causal constraints (skipped 7 transitions) in 5 ms.
[2023-03-08 04:35:03] [INFO ] Added : 32 causal constraints over 7 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 04:35:03] [INFO ] Invariant cache hit.
[2023-03-08 04:35:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:35:03] [INFO ] Invariant cache hit.
[2023-03-08 04:35:03] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 04:35:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:35:03] [INFO ] Invariant cache hit.
[2023-03-08 04:35:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 128/128 places, 76/76 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Detected a total of 25/128 stabilizing places and 20/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-08 04:35:03] [INFO ] Invariant cache hit.
[2023-03-08 04:35:03] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:35:03] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 04:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:35:03] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 04:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:35:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:35:03] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:35:03] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-08 04:35:03] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-08 04:35:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-08 04:35:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-08 04:35:04] [INFO ] Computed and/alt/rep : 65/187/65 causal constraints (skipped 7 transitions) in 5 ms.
[2023-03-08 04:35:04] [INFO ] Added : 32 causal constraints over 7 iterations in 73 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22220 reset in 150 ms.
Product exploration explored 100000 steps with 22364 reset in 155 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 04:35:04] [INFO ] Invariant cache hit.
[2023-03-08 04:35:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 04:35:04] [INFO ] Invariant cache hit.
[2023-03-08 04:35:04] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 04:35:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:35:04] [INFO ] Invariant cache hit.
[2023-03-08 04:35:04] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 128/128 places, 76/76 transitions.
Treatment of property DES-PT-02b-LTLFireability-10 finished in 3134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&(p2 U p3)))))'
Support contains 6 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 253 transition count 190
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 237 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 179
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 55 place count 226 transition count 179
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 63 place count 218 transition count 171
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 218 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 218 transition count 168
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 79 place count 213 transition count 163
Iterating global reduction 4 with 5 rules applied. Total rules applied 84 place count 213 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 90 place count 213 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 92 place count 212 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 92 place count 212 transition count 154
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 96 place count 210 transition count 154
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 244 place count 136 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 135 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 133 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 132 transition count 78
Applied a total of 249 rules in 26 ms. Remains 132 /260 variables (removed 128) and now considering 78/211 (removed 133) transitions.
// Phase 1: matrix 78 rows 132 cols
[2023-03-08 04:35:04] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:35:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:35:04] [INFO ] Invariant cache hit.
[2023-03-08 04:35:04] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-08 04:35:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:35:04] [INFO ] Invariant cache hit.
[2023-03-08 04:35:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/260 places, 78/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 132/260 places, 78/211 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s72 1)), p1:(EQ s127 1), p3:(AND (EQ s32 1) (EQ s37 1)), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-11 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1||X(G(p2)))))))'
Support contains 4 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 247 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 247 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 247 transition count 194
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 242 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 242 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 241 transition count 182
Applied a total of 48 rules in 16 ms. Remains 241 /260 variables (removed 19) and now considering 182/211 (removed 29) transitions.
// Phase 1: matrix 182 rows 241 cols
[2023-03-08 04:35:05] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 04:35:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:35:05] [INFO ] Invariant cache hit.
[2023-03-08 04:35:05] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-08 04:35:05] [INFO ] Invariant cache hit.
[2023-03-08 04:35:05] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/260 places, 182/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 241/260 places, 182/211 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : DES-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s92 1)), p1:(EQ s15 1), p2:(NEQ s69 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 89 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-12 finished in 534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)||p0))||F(p2))))'
Support contains 6 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 249 transition count 197
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 244 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 244 transition count 192
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 244 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 243 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 243 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 243 transition count 185
Applied a total of 43 rules in 15 ms. Remains 243 /260 variables (removed 17) and now considering 185/211 (removed 26) transitions.
// Phase 1: matrix 185 rows 243 cols
[2023-03-08 04:35:05] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 04:35:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 04:35:05] [INFO ] Invariant cache hit.
[2023-03-08 04:35:05] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-08 04:35:05] [INFO ] Invariant cache hit.
[2023-03-08 04:35:06] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/260 places, 185/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 243/260 places, 185/211 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s77 1) (EQ s84 1)), p0:(OR (AND (EQ s59 1) (EQ s167 1) (EQ s195 1)) (EQ s178 1)), p1:(EQ s178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 223 steps with 1 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-13 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p0)&&(X(X(p1)) U p1))))||(G(p1) U p1)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 247 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 247 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 247 transition count 194
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 242 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 242 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 241 transition count 182
Applied a total of 48 rules in 12 ms. Remains 241 /260 variables (removed 19) and now considering 182/211 (removed 29) transitions.
// Phase 1: matrix 182 rows 241 cols
[2023-03-08 04:35:06] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 04:35:06] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:35:06] [INFO ] Invariant cache hit.
[2023-03-08 04:35:06] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-08 04:35:06] [INFO ] Invariant cache hit.
[2023-03-08 04:35:06] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/260 places, 182/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 241/260 places, 182/211 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s97 1)), p0:(EQ s85 1)], nbAcceptance=0, 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-15 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Found a Lengthening insensitive property : DES-PT-02b-LTLFireability-04
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 253 transition count 189
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 35 place count 236 transition count 180
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 53 place count 227 transition count 180
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 219 transition count 172
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 219 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 219 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 215 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 215 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 86 place count 215 transition count 159
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 214 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 88 place count 214 transition count 156
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 212 transition count 156
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 242 place count 137 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 250 place count 133 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 131 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 130 transition count 88
Applied a total of 253 rules in 26 ms. Remains 130 /260 variables (removed 130) and now considering 88/211 (removed 123) transitions.
// Phase 1: matrix 88 rows 130 cols
[2023-03-08 04:35:07] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:35:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:35:07] [INFO ] Invariant cache hit.
[2023-03-08 04:35:07] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-08 04:35:07] [INFO ] Invariant cache hit.
[2023-03-08 04:35:07] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/260 places, 88/211 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 252 ms. Remains : 130/260 places, 88/211 transitions.
Running random walk in product with property : DES-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s1 1) (EQ s43 1)) (AND (EQ s18 1) (NOT (AND (EQ s1 1) (EQ s43 1))))), p0:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 3 reset in 0 ms.
Treatment of property DES-PT-02b-LTLFireability-04 finished in 464 ms.
FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2023-03-08 04:35:07] [INFO ] Flatten gal took : 13 ms
[2023-03-08 04:35:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 04:35:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 260 places, 211 transitions and 627 arcs took 2 ms.
Total runtime 29328 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-02b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-02b-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678250153612

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-02b-LTLFireability-00
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-02b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-10: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 16/32 DES-PT-02b-LTLFireability-00 2438373 m, 487674 m/sec, 4043437 t fired, .

Time elapsed: 5 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-02b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-10: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 32/32 DES-PT-02b-LTLFireability-00 4921964 m, 496718 m/sec, 8132304 t fired, .

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for DES-PT-02b-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DES-PT-02b-LTLFireability-10: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 10 (type EXCL) for 9 DES-PT-02b-LTLFireability-04
lola: time limit : 896 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for DES-PT-02b-LTLFireability-04
lola: result : false
lola: markings : 85
lola: fired transitions : 85
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 15 (type EXCL) for 12 DES-PT-02b-LTLFireability-10
lola: time limit : 1195 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for DES-PT-02b-LTLFireability-10
lola: result : false
lola: markings : 861
lola: fired transitions : 1304
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-02b-LTLFireability-01
lola: time limit : 1792 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1792 10/32 DES-PT-02b-LTLFireability-01 1435954 m, 287190 m/sec, 4587628 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1792 20/32 DES-PT-02b-LTLFireability-01 2992008 m, 311210 m/sec, 9025596 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1792 29/32 DES-PT-02b-LTLFireability-01 4383959 m, 278390 m/sec, 13455596 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for DES-PT-02b-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-02b-LTLFireability-03
lola: time limit : 3565 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3565 17/32 DES-PT-02b-LTLFireability-03 2519735 m, 503947 m/sec, 3851526 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for DES-PT-02b-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-02b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-02b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-02b-LTLFireability-00: LTL unknown AGGR
DES-PT-02b-LTLFireability-01: LTL unknown AGGR
DES-PT-02b-LTLFireability-03: LTL unknown AGGR
DES-PT-02b-LTLFireability-04: LTL false LTL model checker
DES-PT-02b-LTLFireability-10: F true state space / EG


Time elapsed: 45 secs. Pages in use: 32

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="DES-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-02b, 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 r103-tall-167814478200388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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