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-167814478200372.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-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478200372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 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.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:43 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 68K 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-01b-LTLFireability-00
FORMULA_NAME DES-PT-01b-LTLFireability-01
FORMULA_NAME DES-PT-01b-LTLFireability-02
FORMULA_NAME DES-PT-01b-LTLFireability-03
FORMULA_NAME DES-PT-01b-LTLFireability-04
FORMULA_NAME DES-PT-01b-LTLFireability-05
FORMULA_NAME DES-PT-01b-LTLFireability-06
FORMULA_NAME DES-PT-01b-LTLFireability-07
FORMULA_NAME DES-PT-01b-LTLFireability-08
FORMULA_NAME DES-PT-01b-LTLFireability-09
FORMULA_NAME DES-PT-01b-LTLFireability-10
FORMULA_NAME DES-PT-01b-LTLFireability-11
FORMULA_NAME DES-PT-01b-LTLFireability-12
FORMULA_NAME DES-PT-01b-LTLFireability-13
FORMULA_NAME DES-PT-01b-LTLFireability-14
FORMULA_NAME DES-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678247829810

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-01b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 03:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:57:11] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-08 03:57:11] [INFO ] Transformed 284 places.
[2023-03-08 03:57:11] [INFO ] Transformed 235 transitions.
[2023-03-08 03:57:11] [INFO ] Found NUPN structural information;
[2023-03-08 03:57:11] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-01b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 260 transition count 214
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 260 transition count 214
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 249 transition count 203
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 249 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 75 place count 249 transition count 195
Applied a total of 75 rules in 50 ms. Remains 249 /284 variables (removed 35) and now considering 195/235 (removed 40) transitions.
// Phase 1: matrix 195 rows 249 cols
[2023-03-08 03:57:11] [INFO ] Computed 62 place invariants in 23 ms
[2023-03-08 03:57:11] [INFO ] Implicit Places using invariants in 261 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 286 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/284 places, 195/235 transitions.
Applied a total of 0 rules in 10 ms. Remains 247 /247 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 347 ms. Remains : 247/284 places, 195/235 transitions.
Support contains 26 out of 247 places after structural reductions.
[2023-03-08 03:57:12] [INFO ] Flatten gal took : 35 ms
[2023-03-08 03:57:12] [INFO ] Flatten gal took : 14 ms
[2023-03-08 03:57:12] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 24 out of 247 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 195 rows 247 cols
[2023-03-08 03:57:12] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 03:57:12] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-08 03:57:12] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 20 ms returned sat
[2023-03-08 03:57:12] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 03:57:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 03:57:12] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-08 03:57:12] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 03:57:13] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 03:57:13] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 240 transition count 167
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 219 transition count 167
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 45 place count 219 transition count 157
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 65 place count 209 transition count 157
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 204 transition count 152
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 204 transition count 152
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 2 with 5 rules applied. Total rules applied 80 place count 204 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 203 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 203 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 202 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 201 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 201 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 201 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 201 transition count 142
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 200 transition count 142
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 239 place count 125 transition count 67
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 243 place count 123 transition count 69
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 244 place count 123 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 245 place count 122 transition count 68
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 122 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 121 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 249 place count 119 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 119 transition count 67
Applied a total of 250 rules in 89 ms. Remains 119 /247 variables (removed 128) and now considering 67/195 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 119/247 places, 67/195 transitions.
Finished random walk after 1173 steps, including 84 resets, run visited all 2 properties in 12 ms. (steps per millisecond=97 )
FORMULA DES-PT-01b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 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(G(p0))||G((F(p1) U X(p2)))))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 28 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2023-03-08 03:57:13] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 03:57:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 03:57:13] [INFO ] Invariant cache hit.
[2023-03-08 03:57:13] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 03:57:13] [INFO ] Invariant cache hit.
[2023-03-08 03:57:14] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s78 1), p0:(EQ s78 0), p2:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1139 reset in 291 ms.
Product exploration explored 100000 steps with 1139 reset in 229 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 03:57:15] [INFO ] Invariant cache hit.
[2023-03-08 03:57:15] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 03:57:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 03:57:15] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-08 03:57:15] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 352 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 230 transition count 158
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 214 transition count 158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 214 transition count 145
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 203 place count 129 transition count 73
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 2 with 4 rules applied. Total rules applied 207 place count 127 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 125 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 211 place count 123 transition count 73
Applied a total of 211 rules in 43 ms. Remains 123 /236 variables (removed 113) and now considering 73/178 (removed 105) transitions.
// Phase 1: matrix 73 rows 123 cols
[2023-03-08 03:57:16] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-08 03:57:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 03:57:16] [INFO ] Invariant cache hit.
[2023-03-08 03:57:16] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [7, 31, 35, 40, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 118]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 190 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/236 places, 73/178 transitions.
Graph (complete) has 237 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 98 transition count 61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 89 transition count 61
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 65 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 64 transition count 50
Applied a total of 55 rules in 8 ms. Remains 64 /102 variables (removed 38) and now considering 50/73 (removed 23) transitions.
// Phase 1: matrix 50 rows 64 cols
[2023-03-08 03:57:16] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-08 03:57:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:57:16] [INFO ] Invariant cache hit.
[2023-03-08 03:57:16] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/236 places, 50/178 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 49
Applied a total of 2 rules in 4 ms. Remains 62 /63 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 62 cols
[2023-03-08 03:57:16] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-08 03:57:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 03:57:16] [INFO ] Invariant cache hit.
[2023-03-08 03:57:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:57:16] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 62/236 places, 49/178 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 465 ms. Remains : 62/236 places, 49/178 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/62 stabilizing places and 9/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 4 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 33 steps, including 2 resets, run visited all 3 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 4 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8538 reset in 149 ms.
Product exploration explored 100000 steps with 8570 reset in 252 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-08 03:57:18] [INFO ] Invariant cache hit.
[2023-03-08 03:57:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 03:57:18] [INFO ] Invariant cache hit.
[2023-03-08 03:57:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:57:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-08 03:57:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:57:18] [INFO ] Invariant cache hit.
[2023-03-08 03:57:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 62/62 places, 49/49 transitions.
Treatment of property DES-PT-01b-LTLFireability-00 finished in 4959 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(p1)))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 241 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 239 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 239 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 239 transition count 183
Applied a total of 20 rules in 19 ms. Remains 239 /247 variables (removed 8) and now considering 183/195 (removed 12) transitions.
// Phase 1: matrix 183 rows 239 cols
[2023-03-08 03:57:18] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 03:57:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 03:57:18] [INFO ] Invariant cache hit.
[2023-03-08 03:57:18] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 03:57:18] [INFO ] Invariant cache hit.
[2023-03-08 03:57:18] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/247 places, 183/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 239/247 places, 183/195 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-01b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s41 1) (EQ s221 1)), p0:(EQ s33 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-04 finished in 491 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)&&F(G(p1)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 239 transition count 173
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 223 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 220 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 39 place count 220 transition count 160
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 59 place count 210 transition count 160
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 204 transition count 154
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 204 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 76 place count 204 transition count 149
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 78 place count 203 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 203 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 202 transition count 147
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 81 place count 201 transition count 146
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 201 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 83 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 83 place count 201 transition count 144
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 85 place count 200 transition count 144
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 233 place count 126 transition count 70
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 235 place count 125 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 237 place count 123 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 239 place count 121 transition count 68
Applied a total of 239 rules in 44 ms. Remains 121 /247 variables (removed 126) and now considering 68/195 (removed 127) transitions.
// Phase 1: matrix 68 rows 121 cols
[2023-03-08 03:57:18] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 03:57:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 03:57:19] [INFO ] Invariant cache hit.
[2023-03-08 03:57:19] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [7, 30, 34, 38, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 94, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 172 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/247 places, 68/195 transitions.
Graph (complete) has 226 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 95 transition count 55
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 85 transition count 55
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 59 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 57 transition count 42
Applied a total of 62 rules in 6 ms. Remains 57 /99 variables (removed 42) and now considering 42/68 (removed 26) transitions.
// Phase 1: matrix 42 rows 57 cols
[2023-03-08 03:57:19] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 03:57:19] [INFO ] Implicit Places using invariants in 38 ms returned [42, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/247 places, 42/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 38
Applied a total of 6 rules in 4 ms. Remains 52 /55 variables (removed 3) and now considering 38/42 (removed 4) transitions.
// Phase 1: matrix 38 rows 52 cols
[2023-03-08 03:57:19] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 03:57:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 03:57:19] [INFO ] Invariant cache hit.
[2023-03-08 03:57:19] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/247 places, 38/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 349 ms. Remains : 52/247 places, 38/195 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s49 0), p1:(OR (EQ s7 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10819 reset in 176 ms.
Product exploration explored 100000 steps with 10811 reset in 185 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 19 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2023-03-08 03:57:20] [INFO ] Invariant cache hit.
[2023-03-08 03:57:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 03:57:20] [INFO ] Invariant cache hit.
[2023-03-08 03:57:20] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 03:57:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:57:20] [INFO ] Invariant cache hit.
[2023-03-08 03:57:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 52/52 places, 38/38 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (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 p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 10818 reset in 150 ms.
Product exploration explored 100000 steps with 10787 reset in 145 ms.
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2023-03-08 03:57:21] [INFO ] Invariant cache hit.
[2023-03-08 03:57:21] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 03:57:21] [INFO ] Invariant cache hit.
[2023-03-08 03:57:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 03:57:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:57:21] [INFO ] Invariant cache hit.
[2023-03-08 03:57:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 52/52 places, 38/38 transitions.
Treatment of property DES-PT-01b-LTLFireability-05 finished in 2999 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 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 239 transition count 170
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 220 transition count 170
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 220 transition count 159
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 209 transition count 159
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 204 transition count 154
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 204 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 204 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 204 transition count 150
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 203 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 202 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 202 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 202 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 202 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 201 transition count 147
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 4 with 146 rules applied. Total rules applied 227 place count 128 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 231 place count 126 transition count 79
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 126 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 124 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 239 place count 122 transition count 73
Applied a total of 239 rules in 32 ms. Remains 122 /247 variables (removed 125) and now considering 73/195 (removed 122) transitions.
// Phase 1: matrix 73 rows 122 cols
[2023-03-08 03:57:21] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 03:57:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:57:21] [INFO ] Invariant cache hit.
[2023-03-08 03:57:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [7, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 117]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 175 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/247 places, 73/195 transitions.
Graph (complete) has 234 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 97 transition count 60
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 60
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 62 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 60 transition count 48
Applied a total of 60 rules in 5 ms. Remains 60 /101 variables (removed 41) and now considering 48/73 (removed 25) transitions.
// Phase 1: matrix 48 rows 60 cols
[2023-03-08 03:57:22] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-08 03:57:22] [INFO ] Implicit Places using invariants in 49 ms returned [46, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/247 places, 48/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 56 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 56 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 55 transition count 44
Applied a total of 6 rules in 4 ms. Remains 55 /58 variables (removed 3) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 55 cols
[2023-03-08 03:57:22] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-08 03:57:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:57:22] [INFO ] Invariant cache hit.
[2023-03-08 03:57:22] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/247 places, 44/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 357 ms. Remains : 55/247 places, 44/195 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s6 1) (NEQ s31 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 9989 reset in 146 ms.
Product exploration explored 100000 steps with 9843 reset in 171 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 44/44 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-08 03:57:23] [INFO ] Invariant cache hit.
[2023-03-08 03:57:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 03:57:23] [INFO ] Invariant cache hit.
[2023-03-08 03:57:23] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-08 03:57:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:57:23] [INFO ] Invariant cache hit.
[2023-03-08 03:57:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 55/55 places, 44/44 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 173 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9805 reset in 138 ms.
Product exploration explored 100000 steps with 9900 reset in 151 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-08 03:57:24] [INFO ] Invariant cache hit.
[2023-03-08 03:57:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 03:57:24] [INFO ] Invariant cache hit.
[2023-03-08 03:57:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 03:57:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:57:24] [INFO ] Invariant cache hit.
[2023-03-08 03:57:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 55/55 places, 44/44 transitions.
Treatment of property DES-PT-01b-LTLFireability-06 finished in 2503 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 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 240 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 237 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 237 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 237 transition count 180
Applied a total of 25 rules in 10 ms. Remains 237 /247 variables (removed 10) and now considering 180/195 (removed 15) transitions.
// Phase 1: matrix 180 rows 237 cols
[2023-03-08 03:57:24] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 03:57:24] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-08 03:57:24] [INFO ] Invariant cache hit.
[2023-03-08 03:57:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-08 03:57:24] [INFO ] Invariant cache hit.
[2023-03-08 03:57:24] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/247 places, 180/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 237/247 places, 180/195 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-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:(OR (EQ s39 0) (EQ s219 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-07 finished in 455 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&&G(p1))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 239 transition count 171
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 221 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 221 transition count 160
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 210 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 206 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 206 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 71 place count 206 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 73 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 204 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 203 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 203 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 203 transition count 148
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 222 place count 131 transition count 76
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 228 place count 128 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 126 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 232 place count 124 transition count 77
Applied a total of 232 rules in 29 ms. Remains 124 /247 variables (removed 123) and now considering 77/195 (removed 118) transitions.
// Phase 1: matrix 77 rows 124 cols
[2023-03-08 03:57:24] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-08 03:57:24] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 03:57:24] [INFO ] Invariant cache hit.
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [7, 32, 36, 41, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 97, 119]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 198 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/247 places, 77/195 transitions.
Graph (complete) has 238 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 98 transition count 64
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 88 transition count 64
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 62 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 61 transition count 51
Applied a total of 61 rules in 6 ms. Remains 61 /102 variables (removed 41) and now considering 51/77 (removed 26) transitions.
// Phase 1: matrix 51 rows 61 cols
[2023-03-08 03:57:25] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants in 42 ms returned [40, 47, 50]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/247 places, 51/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 55 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 55 transition count 47
Applied a total of 6 rules in 4 ms. Remains 55 /58 variables (removed 3) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 55 cols
[2023-03-08 03:57:25] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 03:57:25] [INFO ] Invariant cache hit.
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/247 places, 47/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 372 ms. Remains : 55/247 places, 47/195 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s16 1), p1:(AND (EQ s9 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-08 finished in 448 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 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 239 transition count 171
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 221 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 221 transition count 160
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 210 transition count 160
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 204 transition count 154
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 204 transition count 154
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 2 with 5 rules applied. Total rules applied 76 place count 204 transition count 149
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 203 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 203 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 202 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 201 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 201 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 83 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 200 transition count 144
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 231 place count 127 transition count 71
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 235 place count 125 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 123 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 239 place count 121 transition count 71
Applied a total of 239 rules in 35 ms. Remains 121 /247 variables (removed 126) and now considering 71/195 (removed 124) transitions.
// Phase 1: matrix 71 rows 121 cols
[2023-03-08 03:57:25] [INFO ] Computed 56 place invariants in 0 ms
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:57:25] [INFO ] Invariant cache hit.
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [7, 29, 33, 37, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 93, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 182 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/247 places, 71/195 transitions.
Graph (complete) has 226 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 95 transition count 58
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 85 transition count 58
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 59 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 57 transition count 45
Applied a total of 62 rules in 5 ms. Remains 57 /99 variables (removed 42) and now considering 45/71 (removed 26) transitions.
// Phase 1: matrix 45 rows 57 cols
[2023-03-08 03:57:25] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants in 48 ms returned [43, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/247 places, 45/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 41
Applied a total of 6 rules in 3 ms. Remains 52 /55 variables (removed 3) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 52 cols
[2023-03-08 03:57:25] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 03:57:25] [INFO ] Invariant cache hit.
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/247 places, 41/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 363 ms. Remains : 52/247 places, 41/195 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 460 steps with 64 reset in 3 ms.
FORMULA DES-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-09 finished in 453 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' '!(((!p0||(p1&&X(p2))) U (G((!p0||(p1&&X(p2))))||((!p0||(p1&&X(p2)))&&X(!p2)))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 17 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2023-03-08 03:57:25] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 03:57:25] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 03:57:25] [INFO ] Invariant cache hit.
[2023-03-08 03:57:26] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-08 03:57:26] [INFO ] Invariant cache hit.
[2023-03-08 03:57:26] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1) p2), (OR (NOT p2) (AND p0 (NOT p1)))]
Running random walk in product with property : DES-PT-01b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s2 1) (EQ s75 1)), p1:(NEQ s20 1), p2:(NEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 211 steps with 9 reset in 4 ms.
FORMULA DES-PT-01b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-11 finished in 486 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 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 240 transition count 184
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 238 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 238 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 238 transition count 180
Applied a total of 24 rules in 8 ms. Remains 238 /247 variables (removed 9) and now considering 180/195 (removed 15) transitions.
// Phase 1: matrix 180 rows 238 cols
[2023-03-08 03:57:26] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 03:57:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 03:57:26] [INFO ] Invariant cache hit.
[2023-03-08 03:57:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 03:57:26] [INFO ] Invariant cache hit.
[2023-03-08 03:57:26] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/247 places, 180/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 238/247 places, 180/195 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-12 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:(NEQ s64 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 5558 steps with 61 reset in 17 ms.
FORMULA DES-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-12 finished in 460 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((G(F(!p0))||(F(!p0)&&(!p1||X(p0))))))'
Support contains 1 out of 247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 239 transition count 171
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 221 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 221 transition count 160
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 210 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 205 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 205 transition count 155
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 205 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 205 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 204 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 203 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 203 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 203 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 203 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 202 transition count 148
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 223 place count 130 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 128 transition count 81
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 231 place count 128 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 126 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 235 place count 124 transition count 75
Applied a total of 235 rules in 25 ms. Remains 124 /247 variables (removed 123) and now considering 75/195 (removed 120) transitions.
// Phase 1: matrix 75 rows 124 cols
[2023-03-08 03:57:26] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 03:57:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 03:57:26] [INFO ] Invariant cache hit.
[2023-03-08 03:57:26] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [7, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 119]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 199 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/247 places, 75/195 transitions.
Graph (complete) has 234 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 99 transition count 62
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 89 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 64 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 62 transition count 50
Applied a total of 60 rules in 4 ms. Remains 62 /103 variables (removed 41) and now considering 50/75 (removed 25) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-08 03:57:26] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-08 03:57:26] [INFO ] Implicit Places using invariants in 41 ms returned [48, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/247 places, 50/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 57 transition count 46
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 57 cols
[2023-03-08 03:57:26] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-08 03:57:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 03:57:27] [INFO ] Invariant cache hit.
[2023-03-08 03:57:27] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/247 places, 46/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 360 ms. Remains : 57/247 places, 46/195 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : DES-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s46 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-13 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-13 finished in 411 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((G(p0) U X(X(G(!p1)))))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 12 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2023-03-08 03:57:27] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 03:57:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 03:57:27] [INFO ] Invariant cache hit.
[2023-03-08 03:57:27] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-08 03:57:27] [INFO ] Invariant cache hit.
[2023-03-08 03:57:27] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 289 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, true, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-01b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s30 1), p1:(AND (EQ s20 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 948 steps with 9 reset in 2 ms.
FORMULA DES-PT-01b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-14 finished in 692 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(X(G(p2))))))))'
Support contains 5 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 12 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
[2023-03-08 03:57:27] [INFO ] Invariant cache hit.
[2023-03-08 03:57:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 03:57:27] [INFO ] Invariant cache hit.
[2023-03-08 03:57:28] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-08 03:57:28] [INFO ] Invariant cache hit.
[2023-03-08 03:57:28] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DES-PT-01b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=p1, acceptance={1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 4}, { cond=p1, acceptance={1} source=3 dest: 5}, { cond=p1, acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 0}]], initial=7, aps=[p0:(EQ s100 1), p1:(OR (EQ s160 0) (EQ s188 0)), p2:(OR (EQ s68 0) (EQ s70 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2012 reset in 179 ms.
Product exploration explored 100000 steps with 2064 reset in 192 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 11 states, 40 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 532 ms :[(AND (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 03:57:30] [INFO ] Invariant cache hit.
[2023-03-08 03:57:30] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 03:57:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 03:57:30] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-08 03:57:30] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 03:57:30] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-08 03:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 03:57:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2023-03-08 03:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 03:57:30] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 03:57:30] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 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
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 231 transition count 153
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 211 transition count 153
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 43 place count 211 transition count 140
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 69 place count 198 transition count 140
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 205 place count 130 transition count 72
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 2 with 4 rules applied. Total rules applied 209 place count 128 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 210 place count 128 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 211 place count 127 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 127 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 126 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 124 transition count 72
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 124 transition count 72
Applied a total of 216 rules in 19 ms. Remains 124 /236 variables (removed 112) and now considering 72/178 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 124/236 places, 72/178 transitions.
Incomplete random walk after 10000 steps, including 595 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :2
Finished Best-First random walk after 2456 steps, including 28 resets, run visited all 2 properties in 6 ms. (steps per millisecond=409 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p1)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p0 p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 4 factoid took 393 ms. Reduced automaton from 11 states, 40 edges and 3 AP (stutter insensitive) to 11 states, 40 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 230 transition count 156
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 212 transition count 156
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 212 transition count 143
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 199 transition count 143
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 199 place count 131 transition count 75
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 2 with 4 rules applied. Total rules applied 203 place count 129 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 127 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 207 place count 125 transition count 75
Applied a total of 207 rules in 17 ms. Remains 125 /236 variables (removed 111) and now considering 75/178 (removed 103) transitions.
// Phase 1: matrix 75 rows 125 cols
[2023-03-08 03:57:31] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-08 03:57:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 03:57:32] [INFO ] Invariant cache hit.
[2023-03-08 03:57:32] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [7, 29, 33, 44, 46, 48, 50, 52, 54, 56, 58, 76, 120]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 198 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/236 places, 75/178 transitions.
Graph (complete) has 264 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 108 transition count 70
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 106 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 25 place count 96 transition count 60
Applied a total of 25 rules in 4 ms. Remains 96 /112 variables (removed 16) and now considering 60/75 (removed 15) transitions.
// Phase 1: matrix 60 rows 96 cols
[2023-03-08 03:57:32] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-08 03:57:32] [INFO ] Implicit Places using invariants in 65 ms returned [34, 53, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/236 places, 60/178 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 93 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 59
Applied a total of 2 rules in 2 ms. Remains 92 /93 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 92 cols
[2023-03-08 03:57:32] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-08 03:57:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 03:57:32] [INFO ] Invariant cache hit.
[2023-03-08 03:57:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 03:57:32] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 92/236 places, 59/178 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 435 ms. Remains : 92/236 places, 59/178 transitions.
Computed a total of 15 stabilizing places and 9 stable transitions
Computed a total of 15 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1))))]
Knowledge based reduction with 13 factoid took 950 ms. Reduced automaton from 11 states, 40 edges and 3 AP (stutter insensitive) to 11 states, 40 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 584 ms :[(AND (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Incomplete random walk after 10000 steps, including 762 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 03:57:33] [INFO ] Invariant cache hit.
[2023-03-08 03:57:34] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 03:57:34] [INFO ] [Nat]Absence check using 24 positive place invariants in 3 ms returned sat
[2023-03-08 03:57:34] [INFO ] [Nat]Absence check using 24 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-08 03:57:34] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 03:57:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 03:57:34] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 03:57:34] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 03:57:34] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (F (NOT (AND p2 p1))), (F (NOT p1)), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) p2 p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 13 factoid took 958 ms. Reduced automaton from 11 states, 40 edges and 3 AP (stutter insensitive) to 11 states, 40 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), false, (AND p1 (NOT p2) p0), false]
Product exploration explored 100000 steps with 8092 reset in 187 ms.
Product exploration explored 100000 steps with 8056 reset in 193 ms.
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-08 03:57:36] [INFO ] Invariant cache hit.
[2023-03-08 03:57:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 03:57:36] [INFO ] Invariant cache hit.
[2023-03-08 03:57:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 03:57:36] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-08 03:57:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:57:36] [INFO ] Invariant cache hit.
[2023-03-08 03:57:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 92/92 places, 59/59 transitions.
Treatment of property DES-PT-01b-LTLFireability-15 finished in 9236 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(G(p0))||G((F(p1) U X(p2)))))))'
Found a Lengthening insensitive property : DES-PT-01b-LTLFireability-00
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 438 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 239 transition count 172
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 222 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 222 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 211 transition count 161
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 205 transition count 155
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 205 transition count 155
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 2 with 5 rules applied. Total rules applied 74 place count 205 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 204 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 204 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 203 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 202 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 202 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 202 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 227 place count 129 transition count 73
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 231 place count 127 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 125 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 235 place count 123 transition count 73
Applied a total of 235 rules in 25 ms. Remains 123 /247 variables (removed 124) and now considering 73/195 (removed 122) transitions.
// Phase 1: matrix 73 rows 123 cols
[2023-03-08 03:57:37] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-08 03:57:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 03:57:37] [INFO ] Invariant cache hit.
[2023-03-08 03:57:37] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [7, 31, 35, 40, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 118]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 177 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 102/247 places, 73/195 transitions.
Graph (complete) has 237 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 98 transition count 61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 89 transition count 61
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 65 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 64 transition count 50
Applied a total of 55 rules in 4 ms. Remains 64 /102 variables (removed 38) and now considering 50/73 (removed 23) transitions.
// Phase 1: matrix 50 rows 64 cols
[2023-03-08 03:57:37] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-08 03:57:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 03:57:37] [INFO ] Invariant cache hit.
[2023-03-08 03:57:37] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 63/247 places, 50/195 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 49
Applied a total of 2 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 62 cols
[2023-03-08 03:57:37] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-08 03:57:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 03:57:37] [INFO ] Invariant cache hit.
[2023-03-08 03:57:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:57:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 62/247 places, 49/195 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 412 ms. Remains : 62/247 places, 49/195 transitions.
Running random walk in product with property : DES-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s26 1), p0:(EQ s26 0), p2:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11217 reset in 166 ms.
Product exploration explored 100000 steps with 11211 reset in 151 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/62 stabilizing places and 9/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 848 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 03:57:38] [INFO ] Invariant cache hit.
[2023-03-08 03:57:38] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-08 03:57:38] [INFO ] [Real]Absence check using 11 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-08 03:57:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 03:57:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-08 03:57:38] [INFO ] [Nat]Absence check using 11 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-08 03:57:38] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 374 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-08 03:57:39] [INFO ] Invariant cache hit.
[2023-03-08 03:57:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:57:39] [INFO ] Invariant cache hit.
[2023-03-08 03:57:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:57:39] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-08 03:57:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:57:39] [INFO ] Invariant cache hit.
[2023-03-08 03:57:39] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 62/62 places, 49/49 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/62 stabilizing places and 9/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 4 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 58 steps, including 5 resets, run visited all 3 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 4 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8523 reset in 132 ms.
Product exploration explored 100000 steps with 8516 reset in 138 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-08 03:57:40] [INFO ] Invariant cache hit.
[2023-03-08 03:57:40] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 03:57:40] [INFO ] Invariant cache hit.
[2023-03-08 03:57:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:57:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 03:57:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:57:41] [INFO ] Invariant cache hit.
[2023-03-08 03:57:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 62/62 places, 49/49 transitions.
Treatment of property DES-PT-01b-LTLFireability-00 finished in 4031 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)&&F(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(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((p0||F((G(p1)&&X(X(G(p2))))))))'
[2023-03-08 03:57:41] [INFO ] Flatten gal took : 13 ms
[2023-03-08 03:57:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 03:57:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 247 places, 195 transitions and 576 arcs took 2 ms.
Total runtime 30164 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-01b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA DES-PT-01b-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678247969899

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
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-01b-LTLFireability-00
lola: time limit : 720 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 6/32 DES-PT-01b-LTLFireability-00 872327 m, 174465 m/sec, 3188556 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 12/32 DES-PT-01b-LTLFireability-00 1700262 m, 165587 m/sec, 6446381 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/720 16/32 DES-PT-01b-LTLFireability-00 2451890 m, 150325 m/sec, 9748353 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/720 20/32 DES-PT-01b-LTLFireability-00 3074145 m, 124451 m/sec, 12992559 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/720 25/32 DES-PT-01b-LTLFireability-00 3710318 m, 127234 m/sec, 16165594 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/720 29/32 DES-PT-01b-LTLFireability-00 4408682 m, 139672 m/sec, 19291898 t fired, .

Time elapsed: 30 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for DES-PT-01b-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-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: 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: 4
lola: LAUNCH task # 14 (type EXCL) for 13 DES-PT-01b-LTLFireability-15
lola: time limit : 891 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/891 3/32 DES-PT-01b-LTLFireability-15 442552 m, 88510 m/sec, 3435676 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/891 6/32 DES-PT-01b-LTLFireability-15 860016 m, 83492 m/sec, 6951651 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/891 9/32 DES-PT-01b-LTLFireability-15 1212989 m, 70594 m/sec, 10282867 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/891 11/32 DES-PT-01b-LTLFireability-15 1558611 m, 69124 m/sec, 13687006 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 25/891 13/32 DES-PT-01b-LTLFireability-15 1915300 m, 71337 m/sec, 17022883 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 30/891 16/32 DES-PT-01b-LTLFireability-15 2264746 m, 69889 m/sec, 20359125 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 35/891 18/32 DES-PT-01b-LTLFireability-15 2635842 m, 74219 m/sec, 23653944 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 40/891 21/32 DES-PT-01b-LTLFireability-15 3005891 m, 74009 m/sec, 26859175 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 45/891 23/32 DES-PT-01b-LTLFireability-15 3385368 m, 75895 m/sec, 30090427 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 50/891 25/32 DES-PT-01b-LTLFireability-15 3671278 m, 57182 m/sec, 33366151 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 55/891 27/32 DES-PT-01b-LTLFireability-15 3921008 m, 49946 m/sec, 36668647 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 60/891 29/32 DES-PT-01b-LTLFireability-15 4300460 m, 75890 m/sec, 39934297 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 65/891 32/32 DES-PT-01b-LTLFireability-15 4668487 m, 73605 m/sec, 43235467 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-01b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DES-PT-01b-LTLFireability-05: CONJ 0 2 0 0 2 0 0 0
DES-PT-01b-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-01b-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 6 (type EXCL) for 3 DES-PT-01b-LTLFireability-05
lola: time limit : 1165 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for DES-PT-01b-LTLFireability-05
lola: result : true
lola: markings : 885471
lola: fired transitions : 1458328
lola: time used : 1.000000
lola: memory pages used : 6
lola: LAUNCH task # 11 (type EXCL) for 10 DES-PT-01b-LTLFireability-06
lola: time limit : 1747 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for DES-PT-01b-LTLFireability-06
lola: result : true
lola: markings : 372563
lola: fired transitions : 567779
lola: time used : 1.000000
lola: memory pages used : 3
lola: LAUNCH task # 8 (type EXCL) for 3 DES-PT-01b-LTLFireability-05
lola: time limit : 3493 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for DES-PT-01b-LTLFireability-05
lola: result : false
lola: markings : 153688
lola: fired transitions : 277441
lola: time used : 0.000000
lola: memory pages used : 2
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-01b-LTLFireability-00: LTL unknown AGGR
DES-PT-01b-LTLFireability-05: CONJ false LTL model checker
DES-PT-01b-LTLFireability-06: LTL true LTL model checker
DES-PT-01b-LTLFireability-15: LTL unknown AGGR


Time elapsed: 107 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-01b"
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-01b, 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-167814478200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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