Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 67K May 10 09:33 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-004-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652640412615

Running Version 202205111006
[2022-05-15 18:46:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 18:46:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:46:53] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-15 18:46:53] [INFO ] Transformed 216 places.
[2022-05-15 18:46:53] [INFO ] Transformed 198 transitions.
[2022-05-15 18:46:53] [INFO ] Parsed PT model containing 216 places and 198 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 21 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2022-05-15 18:46:54] [INFO ] Computed 21 place invariants in 14 ms
[2022-05-15 18:46:54] [INFO ] Implicit Places using invariants in 227 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/216 places, 198/198 transitions.
Applied a total of 0 rules in 11 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 211/216 places, 198/198 transitions.
Support contains 45 out of 211 places after structural reductions.
[2022-05-15 18:46:54] [INFO ] Flatten gal took : 44 ms
[2022-05-15 18:46:54] [INFO ] Flatten gal took : 18 ms
[2022-05-15 18:46:54] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 44 out of 211 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:46:55] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-15 18:46:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:46:55] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 6 ms returned sat
[2022-05-15 18:46:56] [INFO ] After 332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :18 real:3
[2022-05-15 18:46:56] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 4 ms to minimize.
[2022-05-15 18:46:56] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2022-05-15 18:46:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2022-05-15 18:46:56] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-15 18:46:57] [INFO ] After 1011ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6 real:15
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-15 18:46:57] [INFO ] After 1365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:17
[2022-05-15 18:46:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:46:57] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 6 ms returned sat
[2022-05-15 18:46:57] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-15 18:46:57] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2022-05-15 18:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-15 18:46:57] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2022-05-15 18:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-15 18:46:57] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2022-05-15 18:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-15 18:46:58] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2022-05-15 18:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-05-15 18:46:58] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 256 ms.
[2022-05-15 18:46:58] [INFO ] After 1459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 767 ms.
Support contains 30 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 198/198 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 211 transition count 169
Reduce places removed 29 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 37 rules applied. Total rules applied 66 place count 182 transition count 161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 74 place count 174 transition count 161
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 74 place count 174 transition count 150
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 96 place count 163 transition count 150
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 146 place count 138 transition count 125
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 154 place count 134 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 134 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 133 transition count 124
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 164 place count 133 transition count 116
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 172 place count 125 transition count 116
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 188 place count 125 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 125 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 124 transition count 115
Applied a total of 190 rules in 57 ms. Remains 124 /211 variables (removed 87) and now considering 115/198 (removed 83) transitions.
Finished structural reductions, in 1 iterations. Remains : 124/211 places, 115/198 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 233521 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 10=1, 15=1, 16=1, 18=1, 19=1, 20=1}
Probabilistic random walk after 233521 steps, saw 116796 distinct states, run finished after 3003 ms. (steps per millisecond=77 ) properties seen :13
Running SMT prover for 8 properties.
// Phase 1: matrix 115 rows 124 cols
[2022-05-15 18:47:03] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-15 18:47:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:47:03] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 6 ms returned sat
[2022-05-15 18:47:03] [INFO ] After 97ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:2
[2022-05-15 18:47:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:47:03] [INFO ] After 50ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :5 real:3
[2022-05-15 18:47:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2022-05-15 18:47:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-05-15 18:47:03] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:03] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:47:03] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-15 18:47:03] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:03] [INFO ] After 69ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-15 18:47:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2022-05-15 18:47:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2022-05-15 18:47:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2022-05-15 18:47:03] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-05-15 18:47:03] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 199 ms.
Support contains 12 out of 124 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 124/124 places, 115/115 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 122 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 122 transition count 112
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 121 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 114 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 112 transition count 105
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 112 transition count 98
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 105 transition count 98
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 105 transition count 98
Applied a total of 41 rules in 19 ms. Remains 105 /124 variables (removed 19) and now considering 98/115 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/124 places, 98/115 transitions.
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 251490 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251490 steps, saw 125808 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 98 rows 105 cols
[2022-05-15 18:47:08] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:47:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:47:08] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 18:47:08] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-15 18:47:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:47:08] [INFO ] After 17ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:08] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:47:08] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-15 18:47:08] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:08] [INFO ] After 49ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:08] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-05-15 18:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-05-15 18:47:08] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-15 18:47:08] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 163 ms.
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 98/98 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 18 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2022-05-15 18:47:09] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:47:09] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 98 rows 105 cols
[2022-05-15 18:47:09] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-15 18:47:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:47:09] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [22, 27, 73, 78, 96, 102]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 397 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 99/105 places, 98/98 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 95
Applied a total of 6 rules in 9 ms. Remains 96 /99 variables (removed 3) and now considering 95/98 (removed 3) transitions.
// Phase 1: matrix 95 rows 96 cols
[2022-05-15 18:47:09] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:47:09] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 95 rows 96 cols
[2022-05-15 18:47:09] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:47:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:47:09] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 96/105 places, 95/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 96/105 places, 95/98 transitions.
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 203865 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203865 steps, saw 101947 distinct states, run finished after 3009 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 95 rows 96 cols
[2022-05-15 18:47:13] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 18:47:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:47:13] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-15 18:47:13] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-15 18:47:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:47:13] [INFO ] After 19ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:13] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:47:13] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-15 18:47:13] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:13] [INFO ] After 47ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2022-05-15 18:47:13] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2022-05-15 18:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2022-05-15 18:47:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2022-05-15 18:47:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 18:47:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2022-05-15 18:47:14] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-15 18:47:14] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 119 ms.
Support contains 12 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 95/95 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 96 cols
[2022-05-15 18:47:14] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:47:14] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 95 rows 96 cols
[2022-05-15 18:47:14] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:47:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:47:14] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2022-05-15 18:47:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 95 rows 96 cols
[2022-05-15 18:47:14] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:47:14] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 95/95 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 96 transition count 90
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 91 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 88 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 88 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 88 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 87 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 87 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 86 transition count 85
Applied a total of 20 rules in 16 ms. Remains 86 /96 variables (removed 10) and now considering 85/95 (removed 10) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 85 rows 86 cols
[2022-05-15 18:47:14] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 18:47:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:47:14] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-15 18:47:14] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-15 18:47:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 18:47:14] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:14] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 18:47:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:47:14] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-15 18:47:14] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:14] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2022-05-15 18:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-15 18:47:14] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 18:47:14] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-15 18:47:14] [INFO ] Flatten gal took : 8 ms
[2022-05-15 18:47:14] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:47:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10150497549734829588.gal : 4 ms
[2022-05-15 18:47:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18403001631233073721.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6655454045999464993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10150497549734829588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18403001631233073721.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18403001631233073721.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :13 after 26
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :26 after 48
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :150 after 256
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :256 after 568
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :568 after 1402
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1402 after 3173
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3173 after 6734
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :6734 after 13848
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :13848 after 28038
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :28038 after 56429
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :56429 after 113213
Detected timeout of ITS tools.
[2022-05-15 18:47:30] [INFO ] Flatten gal took : 7 ms
[2022-05-15 18:47:30] [INFO ] Applying decomposition
[2022-05-15 18:47:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16395099606335241783.txt' '-o' '/tmp/graph16395099606335241783.bin' '-w' '/tmp/graph16395099606335241783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16395099606335241783.bin' '-l' '-1' '-v' '-w' '/tmp/graph16395099606335241783.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:47:30] [INFO ] Decomposing Gal with order
[2022-05-15 18:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:47:30] [INFO ] Removed a total of 73 redundant transitions.
[2022-05-15 18:47:30] [INFO ] Flatten gal took : 66 ms
[2022-05-15 18:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 15 ms.
[2022-05-15 18:47:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13119005148864263384.gal : 7 ms
[2022-05-15 18:47:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5634194888302239883.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6655454045999464993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13119005148864263384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5634194888302239883.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality5634194888302239883.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :654718 after 736058
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2.71668e+06 after 2.96374e+06
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :2.96374e+06 after 2.96388e+06
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :2.96388e+06 after 2.96457e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6775699973804282490
[2022-05-15 18:47:45] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6775699973804282490
Running compilation step : cd /tmp/ltsmin6775699973804282490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin6775699973804282490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6775699973804282490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 211 vertex of which 209 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U G(p1)) U F((X(G(p0))&&p2)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 210 transition count 149
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 162 transition count 149
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 96 place count 162 transition count 142
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 155 transition count 142
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 182 place count 119 transition count 106
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
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 192 place count 114 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 113 transition count 105
Applied a total of 193 rules in 20 ms. Remains 113 /211 variables (removed 98) and now considering 105/198 (removed 93) transitions.
// Phase 1: matrix 105 rows 113 cols
[2022-05-15 18:48:00] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-15 18:48:01] [INFO ] Implicit Places using invariants in 81 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/211 places, 105/198 transitions.
Graph (complete) has 329 edges and 112 vertex of which 111 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 103
Applied a total of 3 rules in 8 ms. Remains 110 /112 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 110 cols
[2022-05-15 18:48:01] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-15 18:48:01] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 103 rows 110 cols
[2022-05-15 18:48:01] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:48:01] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/211 places, 103/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 110/211 places, 103/198 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s18 1) (GEQ s73 1)), p0:(GEQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-00 finished in 641 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(p0)))))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:01] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:48:01] [INFO ] Implicit Places using invariants in 77 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 7 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:01] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:01] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:01] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:01] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s142 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 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-01 finished in 595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:02] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-15 18:48:02] [INFO ] Implicit Places using invariants in 76 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:02] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-15 18:48:02] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:02] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:02] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LT s201 1), p0:(LT s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3322 reset in 210 ms.
Product exploration explored 100000 steps with 3320 reset in 149 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 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 p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:04] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-15 18:48:04] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:48:04] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-15 18:48:04] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-15 18:48:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:48:04] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-15 18:48:04] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-15 18:48:04] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-15 18:48:04] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 158 transition count 146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 100 place count 158 transition count 136
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 148 transition count 136
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 192 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 204 place count 106 transition count 100
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 217 place count 106 transition count 87
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 230 place count 93 transition count 87
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 247 place count 93 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 92 transition count 86
Applied a total of 248 rules in 34 ms. Remains 92 /209 variables (removed 117) and now considering 86/197 (removed 111) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/209 places, 86/197 transitions.
Incomplete random walk after 10000 steps, including 956 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 687 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 683 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Finished probabilistic random walk after 481 steps, run visited all 2 properties in 9 ms. (steps per millisecond=53 )
Probabilistic random walk after 481 steps, saw 251 distinct states, run finished after 9 ms. (steps per millisecond=53 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:05] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-15 18:48:05] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:05] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-15 18:48:05] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:05] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-15 18:48:05] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 209/209 places, 197/197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 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 p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:06] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-15 18:48:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:48:06] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-15 18:48:06] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 18:48:06] [INFO ] After 103ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 18:48:06] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 158 transition count 146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 100 place count 158 transition count 136
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 148 transition count 136
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 196 place count 110 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 208 place count 104 transition count 98
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 221 place count 104 transition count 85
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 234 place count 91 transition count 85
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 250 place count 91 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 90 transition count 84
Applied a total of 251 rules in 16 ms. Remains 90 /209 variables (removed 119) and now considering 84/197 (removed 113) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/209 places, 84/197 transitions.
Incomplete random walk after 10000 steps, including 1299 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 469 steps, run visited all 1 properties in 5 ms. (steps per millisecond=93 )
Probabilistic random walk after 469 steps, saw 245 distinct states, run finished after 5 ms. (steps per millisecond=93 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3327 reset in 98 ms.
Product exploration explored 100000 steps with 3319 reset in 196 ms.
Applying partial POR strategy [true, false, true, true, false, false]
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 208 transition count 196
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 47 place count 208 transition count 203
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 208 transition count 203
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 204 transition count 199
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 204 transition count 199
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 102 place count 204 transition count 207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 203 transition count 206
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 203 transition count 206
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 203 transition count 245
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 194 transition count 227
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 194 transition count 227
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 130 rules in 40 ms. Remains 194 /209 variables (removed 15) and now considering 227/197 (removed -30) transitions.
[2022-05-15 18:48:08] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 227 rows 194 cols
[2022-05-15 18:48:08] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:08] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/209 places, 227/197 transitions.
Finished structural reductions, in 1 iterations. Remains : 194/209 places, 227/197 transitions.
Product exploration explored 100000 steps with 4495 reset in 188 ms.
Product exploration explored 100000 steps with 4510 reset in 187 ms.
Built C files in :
/tmp/ltsmin14747943767080584677
[2022-05-15 18:48:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14747943767080584677
Running compilation step : cd /tmp/ltsmin14747943767080584677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 297 ms.
Running link step : cd /tmp/ltsmin14747943767080584677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14747943767080584677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17291591400026057458.hoa' '--buchi-type=spotba'
LTSmin run took 192 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-004-LTLFireability-02 finished in 7038 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(F(X(p0)))&&G(X(F(p1))))))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 210 transition count 154
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 167 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 164 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 92 place count 164 transition count 143
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 108 place count 156 transition count 143
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 184 place count 118 transition count 105
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 196 place count 112 transition count 105
Applied a total of 196 rules in 19 ms. Remains 112 /211 variables (removed 99) and now considering 105/198 (removed 93) transitions.
// Phase 1: matrix 105 rows 112 cols
[2022-05-15 18:48:09] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 18:48:09] [INFO ] Implicit Places using invariants in 56 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/211 places, 105/198 transitions.
Graph (complete) has 330 edges and 111 vertex of which 110 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 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 3 place count 109 transition count 103
Applied a total of 3 rules in 6 ms. Remains 109 /111 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 109 cols
[2022-05-15 18:48:09] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 18:48:09] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 103 rows 109 cols
[2022-05-15 18:48:09] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 18:48:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:48:09] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/211 places, 103/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 109/211 places, 103/198 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s37 1)), p0:(LT s48 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]]
Stuttering criterion allowed to conclude after 27 steps with 4 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-03 finished in 425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(F(p0))&&p1)||(X(p3)&&p2))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:09] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:48:09] [INFO ] Implicit Places using invariants in 79 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:09] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:09] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:09] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:10] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=3 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(OR (LT s26 1) (LT s42 1)), p2:(AND (GEQ s14 1) (GEQ s49 1)), p0:(OR (LT s14 1) (LT s49 1)), p3:(OR (GEQ s136 1) (AND (GEQ s26 1) (GEQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33157 reset in 237 ms.
Product exploration explored 100000 steps with 33206 reset in 186 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 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 p1 (NOT p2) p0 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (AND p1 p2))), (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (X (OR p1 p2)), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (OR p1 p2))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 795 ms. Reduced automaton from 5 states, 9 edges and 4 AP to 5 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 331 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:13] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:48:13] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2022-05-15 18:48:13] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-15 18:48:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:48:13] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2022-05-15 18:48:13] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-15 18:48:13] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-05-15 18:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-15 18:48:13] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2022-05-15 18:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-15 18:48:13] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-15 18:48:13] [INFO ] After 658ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 207 transition count 151
Reduce places removed 44 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 163 transition count 148
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 160 transition count 148
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 96 place count 160 transition count 138
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 116 place count 150 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 188 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 198 place count 109 transition count 102
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 109 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 108 transition count 101
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 215 place count 108 transition count 86
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 230 place count 93 transition count 86
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 245 place count 93 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 92 transition count 85
Applied a total of 246 rules in 15 ms. Remains 92 /209 variables (removed 117) and now considering 85/197 (removed 112) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/209 places, 85/197 transitions.
Incomplete random walk after 10000 steps, including 1128 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 779 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 799 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 794 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 797 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 787 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 911 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Finished probabilistic random walk after 98319 steps, run visited all 6 properties in 1170 ms. (steps per millisecond=84 )
Probabilistic random walk after 98319 steps, saw 49202 distinct states, run finished after 1172 ms. (steps per millisecond=83 ) properties seen :6
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (AND p1 p2))), (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (X (OR p1 p2)), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (OR p1 p2))), (X (X (AND p1 (NOT p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p2)))), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 19 factoid took 355 ms. Reduced automaton from 5 states, 9 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA DoubleExponent-PT-004-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-04 finished in 6931 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p1)&&p0)) U p2)||X(p3)))'
Support contains 7 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:16] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:48:16] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:16] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-15 18:48:16] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:16] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-15 18:48:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/211 places, 198/198 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1 p0), acceptance={0} source=5 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s180 1) (GEQ s207 1)), p0:(AND (GEQ s85 1) (GEQ s104 1)), p2:(AND (GEQ s154 1) (GEQ s161 1)), p3:(LT s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 211 vertex of which 209 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X p3), true, (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p2) p1 p0)))
Knowledge based reduction with 10 factoid took 177 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-004-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-05 finished in 1207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&F(p1))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:17] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 18:48:17] [INFO ] Implicit Places using invariants in 82 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 8 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:17] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-15 18:48:17] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:17] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GEQ s93 1), p1:(AND (GEQ s41 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-004-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-06 finished in 624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G((X(p1)&&p2)))||G(p1)||X(p0)))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:18] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 18:48:18] [INFO ] Implicit Places using invariants in 79 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:18] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:18] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:18] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-15 18:48:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 2}]], initial=1, aps=[p2:(GEQ s80 1), p1:(GEQ s79 1), p0:(GEQ s171 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-07 finished in 738 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:19] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-15 18:48:19] [INFO ] Implicit Places using invariants in 84 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:19] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-15 18:48:19] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:19] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-15 18:48:19] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-08 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: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(GEQ s118 1), p0:(GEQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-08 finished in 640 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!((F(p0)||p0) U p1))||F(p0)))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 210 transition count 152
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 165 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 164 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 92 place count 164 transition count 143
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 108 place count 156 transition count 143
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 184 place count 118 transition count 105
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 194 place count 113 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 113 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 112 transition count 104
Applied a total of 196 rules in 21 ms. Remains 112 /211 variables (removed 99) and now considering 104/198 (removed 94) transitions.
// Phase 1: matrix 104 rows 112 cols
[2022-05-15 18:48:19] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 18:48:19] [INFO ] Implicit Places using invariants in 55 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/211 places, 104/198 transitions.
Graph (complete) has 320 edges and 111 vertex of which 110 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 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 3 place count 109 transition count 102
Applied a total of 3 rules in 3 ms. Remains 109 /111 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 109 cols
[2022-05-15 18:48:19] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:19] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 102 rows 109 cols
[2022-05-15 18:48:19] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants and state equation in 153 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 : 109/211 places, 102/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 109/211 places, 102/198 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s49 1)), p1:(GEQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-09 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 210 transition count 148
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 161 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 160 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 100 place count 160 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 152 transition count 139
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 192 place count 114 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 108 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 108 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 107 transition count 100
Applied a total of 206 rules in 19 ms. Remains 107 /211 variables (removed 104) and now considering 100/198 (removed 98) transitions.
// Phase 1: matrix 100 rows 107 cols
[2022-05-15 18:48:20] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants in 71 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/211 places, 100/198 transitions.
Graph (complete) has 323 edges and 106 vertex of which 105 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 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 3 place count 104 transition count 98
Applied a total of 3 rules in 2 ms. Remains 104 /106 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 104 cols
[2022-05-15 18:48:20] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 98 rows 104 cols
[2022-05-15 18:48:20] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 18:48:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/211 places, 98/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 104/211 places, 98/198 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s54 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-10 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(G((F(G(F(p0)))||p1)))) U p2)))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:20] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants in 85 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:20] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:20] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:20] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LT s186 1), p0:(GEQ s125 1), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 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 p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-004-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-11 finished in 1147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(X(p0))&&(F(p1) U G(p0))))&&(p0 U X(p2))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:21] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:48:21] [INFO ] Implicit Places using invariants in 77 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 7 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:21] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:21] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:21] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:21] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s24 1), p1:(GEQ s203 1), p2:(GEQ s118 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 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-12 finished in 658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 210 transition count 148
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 161 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 98 place count 161 transition count 140
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 153 transition count 140
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 188 place count 116 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
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 198 place count 111 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 110 transition count 102
Applied a total of 199 rules in 10 ms. Remains 110 /211 variables (removed 101) and now considering 102/198 (removed 96) transitions.
// Phase 1: matrix 102 rows 110 cols
[2022-05-15 18:48:22] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-15 18:48:22] [INFO ] Implicit Places using invariants in 67 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/211 places, 102/198 transitions.
Graph (complete) has 320 edges and 109 vertex of which 108 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 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 3 place count 107 transition count 100
Applied a total of 3 rules in 3 ms. Remains 107 /109 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 107 cols
[2022-05-15 18:48:22] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-15 18:48:22] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 100 rows 107 cols
[2022-05-15 18:48:22] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:48:22] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/211 places, 100/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 107/211 places, 100/198 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s71 1), p1:(AND (GEQ s41 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-13 finished in 437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:22] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-15 18:48:22] [INFO ] Implicit Places using invariants in 78 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 4 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:22] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-15 18:48:22] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:22] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:23] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s38 1), p1:(AND (GEQ s11 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-14 finished in 560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&(G(X(F(G(p2))))||X(p2))))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 211 cols
[2022-05-15 18:48:23] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 18:48:23] [INFO ] Implicit Places using invariants in 82 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/211 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 3 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:23] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-15 18:48:23] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 197 rows 209 cols
[2022-05-15 18:48:23] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-15 18:48:23] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/211 places, 197/198 transitions.
Finished structural reductions, in 2 iterations. Remains : 209/211 places, 197/198 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s194 1), p1:(GEQ s125 1), p2:(AND (GEQ s13 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-15 finished in 582 ms.
All properties solved by simple procedures.
Total runtime 90013 ms.

BK_STOP 1652640503866

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-004, 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 r078-tall-165260110000188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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