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.r135-smll-167819414400452.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 DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414400452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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 DoubleExponent-PT-002-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678328908131

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=DoubleExponent-PT-002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:28:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 02:28:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:28:31] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-09 02:28:31] [INFO ] Transformed 110 places.
[2023-03-09 02:28:31] [INFO ] Transformed 98 transitions.
[2023-03-09 02:28:31] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 32 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:32] [INFO ] Computed 11 place invariants in 18 ms
[2023-03-09 02:28:32] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-09 02:28:32] [INFO ] Invariant cache hit.
[2023-03-09 02:28:32] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-09 02:28:32] [INFO ] Invariant cache hit.
[2023-03-09 02:28:33] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 33 out of 106 places after structural reductions.
[2023-03-09 02:28:33] [INFO ] Flatten gal took : 80 ms
[2023-03-09 02:28:33] [INFO ] Flatten gal took : 24 ms
[2023-03-09 02:28:33] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 977 ms. (steps per millisecond=10 ) properties (out of 26) seen :8
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-09 02:28:35] [INFO ] Invariant cache hit.
[2023-03-09 02:28:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:28:35] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-09 02:28:35] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :1 sat :5 real:12
[2023-03-09 02:28:35] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 8 ms to minimize.
[2023-03-09 02:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 02:28:35] [INFO ] After 376ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-09 02:28:35] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-09 02:28:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:28:35] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-09 02:28:36] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-09 02:28:36] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2023-03-09 02:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 02:28:36] [INFO ] After 476ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-09 02:28:36] [INFO ] After 814ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 277 ms.
Support contains 19 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 106 transition count 91
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 99 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 95 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 95 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 91 transition count 83
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 56 place count 78 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 3 with 2 rules applied. Total rules applied 58 place count 77 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 77 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 76 transition count 69
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 66 place count 76 transition count 63
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 72 place count 70 transition count 63
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 79 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 69 transition count 62
Applied a total of 80 rules in 56 ms. Remains 69 /106 variables (removed 37) and now considering 62/98 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 69/106 places, 62/98 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10000 steps, including 539 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 536 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 545 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 541 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 535 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 62 rows 69 cols
[2023-03-09 02:28:38] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-09 02:28:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:28:38] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-09 02:28:38] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 02:28:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 02:28:38] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 02:28:38] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 02:28:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:28:38] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-09 02:28:38] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 02:28:38] [INFO ] After 49ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 02:28:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
[2023-03-09 02:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-09 02:28:38] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-09 02:28:38] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 88 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 62/62 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 56
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 56
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 58 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 2 with 2 rules applied. Total rules applied 24 place count 57 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 57 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 54 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 53 transition count 48
Applied a total of 33 rules in 35 ms. Remains 53 /69 variables (removed 16) and now considering 48/62 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 53/69 places, 48/62 transitions.
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Finished probabilistic random walk after 2010 steps, run visited all 6 properties in 35 ms. (steps per millisecond=57 )
Probabilistic random walk after 2010 steps, saw 1033 distinct states, run finished after 35 ms. (steps per millisecond=57 ) properties seen :6
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
FORMULA DoubleExponent-PT-002-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(!p1 U !p0)&&X(p2))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 10 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:40] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-09 02:28:40] [INFO ] Implicit Places using invariants in 147 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 105/106 places, 98/98 transitions.
Stuttering acceptance computed with spot in 434 ms :[true, (OR (NOT p2) p0), p0]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p0 p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s90 1), p1:(OR (AND (GEQ s75 1) (GEQ s93 1)) (GEQ s90 1)), p2:(AND (GEQ s42 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 5 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-00 finished in 708 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(!((G(!G(p0))&&X(X(!p0))) U !p1))))'
Support contains 2 out of 106 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 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 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 21 rules applied. Total rules applied 21 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 84 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 44 place count 83 transition count 71
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 58 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 58 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 57 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 57 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 56 transition count 50
Applied a total of 99 rules in 47 ms. Remains 56 /106 variables (removed 50) and now considering 50/98 (removed 48) transitions.
// Phase 1: matrix 50 rows 56 cols
[2023-03-09 02:28:41] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-09 02:28:41] [INFO ] Implicit Places using invariants in 110 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/106 places, 50/98 transitions.
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 0 with 6 rules applied. Total rules applied 7 place count 50 transition count 46
Applied a total of 7 rules in 10 ms. Remains 50 /54 variables (removed 4) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 50 cols
[2023-03-09 02:28:41] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 02:28:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 02:28:41] [INFO ] Invariant cache hit.
[2023-03-09 02:28:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:28:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/106 places, 46/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 50/106 places, 46/98 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s32 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-02 finished in 522 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(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 44 place count 83 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 78 transition count 70
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 94 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 98 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 49
Applied a total of 99 rules in 27 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-09 02:28:41] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 02:28:41] [INFO ] Implicit Places using invariants in 90 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 146 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 8 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-09 02:28:41] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-09 02:28:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 02:28:41] [INFO ] Invariant cache hit.
[2023-03-09 02:28:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:28:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 49/106 places, 45/98 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-03 finished in 359 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) U G((p1&&F(p2)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:41] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 02:28:42] [INFO ] Implicit Places using invariants in 79 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:28:42] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 02:28:42] [INFO ] Invariant cache hit.
[2023-03-09 02:28:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 301 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 504 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s34 1), p2:(AND (GEQ s37 1) (GEQ s57 1)), p0:(OR (GEQ s26 1) (LT s85 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]]
Stuttering criterion allowed to conclude after 38 steps with 3 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-04 finished in 826 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(p0) U p1))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 74
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 82 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 78 transition count 70
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 98 place count 57 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 102 place count 55 transition count 49
Applied a total of 102 rules in 19 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-09 02:28:42] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 02:28:42] [INFO ] Implicit Places using invariants in 90 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 6 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-09 02:28:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:28:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 02:28:43] [INFO ] Invariant cache hit.
[2023-03-09 02:28:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 02:28:43] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 49/106 places, 45/98 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s17 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-06 finished in 494 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(p1)&&p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:43] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 02:28:43] [INFO ] Implicit Places using invariants in 118 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 121 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:43] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-09 02:28:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 02:28:43] [INFO ] Invariant cache hit.
[2023-03-09 02:28:43] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s58 1) (GEQ s65 1)), p0:(AND (GEQ s10 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-08 finished in 656 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&&X((p0 U (!p1||G(p0)))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:43] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 02:28:44] [INFO ] Implicit Places using invariants in 69 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:44] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:28:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 02:28:44] [INFO ] Invariant cache hit.
[2023-03-09 02:28:44] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-09 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: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s85 1), p1:(AND (GEQ s9 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 263 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-09 finished in 1185 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(F(G((F(!(p0 U p1))||(G(p0)&&p2))))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 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 21 rules applied. Total rules applied 21 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 84 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 80 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 94 place count 58 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 57 transition count 51
Applied a total of 95 rules in 20 ms. Remains 57 /106 variables (removed 49) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 57 cols
[2023-03-09 02:28:45] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 02:28:45] [INFO ] Implicit Places using invariants in 111 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/106 places, 51/98 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 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 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 2 with 2 rules applied. Total rules applied 4 place count 54 transition count 49
Applied a total of 4 rules in 8 ms. Remains 54 /56 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 54 cols
[2023-03-09 02:28:45] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 02:28:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 02:28:45] [INFO ] Invariant cache hit.
[2023-03-09 02:28:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:28:45] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/106 places, 49/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 358 ms. Remains : 54/106 places, 49/98 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s38 1) (GEQ s46 1)), p0:(GEQ s2 1), p2:(GEQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12299 reset in 458 ms.
Product exploration explored 100000 steps with 12317 reset in 320 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 144 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 737 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 760 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 749 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 750 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 02:28:47] [INFO ] Invariant cache hit.
[2023-03-09 02:28:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:28:47] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-09 02:28:47] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 02:28:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:28:47] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-09 02:28:47] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-09 02:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:28:47] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-09 02:28:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-09 02:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-09 02:28:48] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2023-03-09 02:28:48] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-09 02:28:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2023-03-09 02:28:48] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 02:28:48] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 49/49 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 43
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 43
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 48 transition count 43
Applied a total of 18 rules in 9 ms. Remains 48 /54 variables (removed 6) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 48/54 places, 43/49 transitions.
Incomplete random walk after 10000 steps, including 1234 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 761 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 742 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Finished probabilistic random walk after 601 steps, run visited all 2 properties in 20 ms. (steps per millisecond=30 )
Probabilistic random walk after 601 steps, saw 311 distinct states, run finished after 20 ms. (steps per millisecond=30 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 11 factoid took 757 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p1, p1]
Stuttering acceptance computed with spot in 116 ms :[p1, p1]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-09 02:28:49] [INFO ] Invariant cache hit.
[2023-03-09 02:28:49] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-09 02:28:49] [INFO ] Invariant cache hit.
[2023-03-09 02:28:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:28:49] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-09 02:28:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:28:49] [INFO ] Invariant cache hit.
[2023-03-09 02:28:49] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 54/54 places, 49/49 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 144 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 400 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 1215 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 771 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 772 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 758 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Probably explored full state space saw : 1996 states, properties seen :2
Probabilistic random walk after 3991 steps, saw 1996 distinct states, run finished after 19 ms. (steps per millisecond=210 ) properties seen :2
Explored full state space saw : 1996 states, properties seen :0
Exhaustive walk after 3991 steps, saw 1996 distinct states, run finished after 9 ms. (steps per millisecond=443 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 8 factoid took 417 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p1, p1]
Stuttering acceptance computed with spot in 105 ms :[p1, p1]
Stuttering acceptance computed with spot in 105 ms :[p1, p1]
Product exploration explored 100000 steps with 12350 reset in 470 ms.
Product exploration explored 100000 steps with 12305 reset in 451 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 49/49 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 53 transition count 48
Applied a total of 2 rules in 14 ms. Remains 53 /54 variables (removed 1) and now considering 48/49 (removed 1) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:28:52] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 02:28:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 02:28:52] [INFO ] Invariant cache hit.
[2023-03-09 02:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 02:28:53] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-09 02:28:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:28:53] [INFO ] Invariant cache hit.
[2023-03-09 02:28:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/54 places, 48/49 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 53/54 places, 48/49 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-10 finished in 7968 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))||F((p1||(!p2 U p3)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:53] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 02:28:53] [INFO ] Implicit Places using invariants in 71 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:53] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:28:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-09 02:28:53] [INFO ] Invariant cache hit.
[2023-03-09 02:28:53] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 293 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s102 1)), p3:(GEQ s56 1), p0:(LT s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3472 reset in 210 ms.
Product exploration explored 100000 steps with 3483 reset in 245 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 258 steps, including 8 resets, run visited all 3 properties in 11 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-09 02:28:55] [INFO ] Invariant cache hit.
[2023-03-09 02:28:55] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-09 02:28:55] [INFO ] Invariant cache hit.
[2023-03-09 02:28:55] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-09 02:28:55] [INFO ] Invariant cache hit.
[2023-03-09 02:28:55] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 45 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 405 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 3476 reset in 192 ms.
Product exploration explored 100000 steps with 3472 reset in 222 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 102 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 18 place count 102 transition count 98
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 102 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 98 transition count 94
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 98 transition count 94
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 52 place count 98 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 97 transition count 98
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 97 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 97 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 93 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 93 transition count 104
Deduced a syphon composed of 37 places in 1 ms
Applied a total of 65 rules in 29 ms. Remains 93 /103 variables (removed 10) and now considering 104/97 (removed -7) transitions.
[2023-03-09 02:28:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 104 rows 93 cols
[2023-03-09 02:28:58] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/103 places, 104/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 93/103 places, 104/97 transitions.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:58] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 02:28:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-09 02:28:58] [INFO ] Invariant cache hit.
[2023-03-09 02:28:58] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-09 02:28:58] [INFO ] Invariant cache hit.
[2023-03-09 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 103/103 places, 97/97 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 5548 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((F(p0)||X(F(p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:58] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 02:28:58] [INFO ] Implicit Places using invariants in 108 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 110 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:58] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 02:28:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-09 02:28:58] [INFO ] Invariant cache hit.
[2023-03-09 02:28:59] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(OR (LT s58 1) (LT s65 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-13 finished in 916 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&&F(!p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:28:59] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 02:28:59] [INFO ] Implicit Places using invariants in 68 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:28:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:28:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 02:28:59] [INFO ] Invariant cache hit.
[2023-03-09 02:28:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s86 1)), p1:(AND (GEQ s9 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3325 reset in 179 ms.
Product exploration explored 100000 steps with 3322 reset in 208 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 385 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 334 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7362 steps, run visited all 3 properties in 53 ms. (steps per millisecond=138 )
Probabilistic random walk after 7362 steps, saw 3706 distinct states, run finished after 53 ms. (steps per millisecond=138 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-09 02:29:02] [INFO ] Invariant cache hit.
[2023-03-09 02:29:02] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 02:29:02] [INFO ] Invariant cache hit.
[2023-03-09 02:29:02] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-09 02:29:02] [INFO ] Invariant cache hit.
[2023-03-09 02:29:02] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7362 steps, run visited all 3 properties in 87 ms. (steps per millisecond=84 )
Probabilistic random walk after 7362 steps, saw 3706 distinct states, run finished after 87 ms. (steps per millisecond=84 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Product exploration explored 100000 steps with 3345 reset in 100 ms.
Product exploration explored 100000 steps with 3333 reset in 120 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 102 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 24 place count 102 transition count 99
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 102 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 98 transition count 95
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 98 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 57 place count 98 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 97 transition count 96
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 97 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 97 transition count 114
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 92 transition count 104
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 92 transition count 104
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 73 rules in 26 ms. Remains 92 /103 variables (removed 11) and now considering 104/97 (removed -7) transitions.
[2023-03-09 02:29:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 104 rows 92 cols
[2023-03-09 02:29:04] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 02:29:05] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/103 places, 104/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 92/103 places, 104/97 transitions.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 02:29:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:29:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 02:29:05] [INFO ] Invariant cache hit.
[2023-03-09 02:29:05] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-09 02:29:05] [INFO ] Invariant cache hit.
[2023-03-09 02:29:05] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 103/103 places, 97/97 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 5966 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(F(G((F(!(p0 U p1))||(G(p0)&&p2))))))'
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))||F((p1||(!p2 U p3)))))'
Found a Lengthening insensitive property : DoubleExponent-PT-002-LTLFireability-12
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 98/98 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 16 place count 105 transition count 81
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 89 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 87 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 36 place count 87 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 82 place count 64 transition count 56
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 3 with 2 rules applied. Total rules applied 84 place count 63 transition count 56
Applied a total of 84 rules in 10 ms. Remains 63 /106 variables (removed 43) and now considering 56/98 (removed 42) transitions.
// Phase 1: matrix 56 rows 63 cols
[2023-03-09 02:29:06] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 02:29:06] [INFO ] Implicit Places using invariants in 87 ms returned [42, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 61/106 places, 56/98 transitions.
Graph (complete) has 156 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 54
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 7 place count 57 transition count 52
Applied a total of 7 rules in 5 ms. Remains 57 /61 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-09 02:29:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:29:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 02:29:06] [INFO ] Invariant cache hit.
[2023-03-09 02:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:29:06] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 57/106 places, 52/98 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 329 ms. Remains : 57/106 places, 52/98 transitions.
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s56 1)), p3:(GEQ s32 1), p0:(LT s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10785 reset in 250 ms.
Product exploration explored 100000 steps with 10777 reset in 281 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 151 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 33 steps, including 2 resets, run visited all 3 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 416 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-09 02:29:08] [INFO ] Invariant cache hit.
[2023-03-09 02:29:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 02:29:08] [INFO ] Invariant cache hit.
[2023-03-09 02:29:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:29:08] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-09 02:29:08] [INFO ] Invariant cache hit.
[2023-03-09 02:29:08] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 57/57 places, 52/52 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 151 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 247 steps, including 26 resets, run visited all 3 properties in 10 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 540 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 10836 reset in 230 ms.
Product exploration explored 100000 steps with 10790 reset in 259 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 56 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 56 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 8 ms. Remains 56 /57 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-09 02:29:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2023-03-09 02:29:10] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:29:10] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/57 places, 52/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 56/57 places, 52/52 transitions.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-09 02:29:10] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:29:10] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 02:29:10] [INFO ] Invariant cache hit.
[2023-03-09 02:29:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:29:10] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-09 02:29:10] [INFO ] Invariant cache hit.
[2023-03-09 02:29:10] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 57/57 places, 52/52 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 5194 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&&F(!p1)))))'
Found a Lengthening insensitive property : DoubleExponent-PT-002-LTLFireability-14
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 77 transition count 69
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 94 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 98 place count 56 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 55 transition count 49
Applied a total of 101 rules in 19 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-09 02:29:11] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 02:29:11] [INFO ] Implicit Places using invariants in 104 ms returned [35, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 106 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 146 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 2 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-09 02:29:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 02:29:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 02:29:11] [INFO ] Invariant cache hit.
[2023-03-09 02:29:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:29:11] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 336 ms. Remains : 49/106 places, 45/98 transitions.
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s40 1)), p1:(AND (GEQ s4 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13873 reset in 206 ms.
Product exploration explored 100000 steps with 13900 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 142 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 786 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2304 steps, run visited all 3 properties in 26 ms. (steps per millisecond=88 )
Probabilistic random walk after 2304 steps, saw 1183 distinct states, run finished after 27 ms. (steps per millisecond=85 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-09 02:29:13] [INFO ] Invariant cache hit.
[2023-03-09 02:29:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 02:29:14] [INFO ] Invariant cache hit.
[2023-03-09 02:29:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:29:14] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-09 02:29:14] [INFO ] Invariant cache hit.
[2023-03-09 02:29:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 49/49 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 142 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 1366 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 790 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2304 steps, run visited all 3 properties in 27 ms. (steps per millisecond=85 )
Probabilistic random walk after 2304 steps, saw 1183 distinct states, run finished after 27 ms. (steps per millisecond=85 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Product exploration explored 100000 steps with 13910 reset in 205 ms.
Product exploration explored 100000 steps with 13795 reset in 241 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-09 02:29:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:29:17] [INFO ] Invariant cache hit.
[2023-03-09 02:29:17] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 49/49 places, 45/45 transitions.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-09 02:29:17] [INFO ] Invariant cache hit.
[2023-03-09 02:29:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 02:29:17] [INFO ] Invariant cache hit.
[2023-03-09 02:29:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:29:17] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-09 02:29:17] [INFO ] Invariant cache hit.
[2023-03-09 02:29:17] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 49/49 places, 45/45 transitions.
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 6508 ms.
[2023-03-09 02:29:17] [INFO ] Flatten gal took : 14 ms
[2023-03-09 02:29:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 02:29:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 98 transitions and 272 arcs took 3 ms.
Total runtime 45842 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-002
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA DoubleExponent-PT-002-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678328958753

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: RELEASE
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: LAUNCH task # 1 (type EXCL) for 0 DoubleExponent-PT-002-LTLFireability-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DoubleExponent-PT-002-LTLFireability-10
lola: result : true
lola: markings : 2472
lola: fired transitions : 2867
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-002-LTLFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DoubleExponent-PT-002-LTLFireability-14
lola: result : false
lola: markings : 876
lola: fired transitions : 953
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-002-LTLFireability-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DoubleExponent-PT-002-LTLFireability-12
lola: result : true
lola: markings : 56
lola: fired transitions : 60
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-002-LTLFireability-10: LTL true LTL model checker
DoubleExponent-PT-002-LTLFireability-12: LTL true LTL model checker
DoubleExponent-PT-002-LTLFireability-14: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r135-smll-167819414400452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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