Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716422205989

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:56:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:56:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:56:47] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-22 23:56:47] [INFO ] Transformed 216 places.
[2024-05-22 23:56:47] [INFO ] Transformed 198 transitions.
[2024-05-22 23:56:47] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-004-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 19 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2024-05-22 23:56:48] [INFO ] Computed 21 invariants in 24 ms
[2024-05-22 23:56:48] [INFO ] Implicit Places using invariants in 333 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 452 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 197
Applied a total of 2 rules in 21 ms. Remains 210 /211 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 210 cols
[2024-05-22 23:56:48] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 23:56:48] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 23:56:48] [INFO ] Invariant cache hit.
[2024-05-22 23:56:48] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 210/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 901 ms. Remains : 210/216 places, 197/198 transitions.
Support contains 49 out of 210 places after structural reductions.
[2024-05-22 23:56:48] [INFO ] Flatten gal took : 38 ms
[2024-05-22 23:56:48] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:56:48] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 44 out of 210 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2024-05-22 23:56:49] [INFO ] Invariant cache hit.
[2024-05-22 23:56:50] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-22 23:56:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:56:50] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 7 ms returned sat
[2024-05-22 23:56:50] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :14
[2024-05-22 23:56:50] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 5 ms to minimize.
[2024-05-22 23:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 2 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 0 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 276 ms
[2024-05-22 23:56:51] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-05-22 23:56:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2024-05-22 23:56:51] [INFO ] After 1324ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :13
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-22 23:56:51] [INFO ] After 1733ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :13
Fused 23 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 159 ms.
Support contains 24 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 208 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 208 transition count 162
Reduce places removed 33 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 175 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 171 transition count 158
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 76 place count 171 transition count 149
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 94 place count 162 transition count 149
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 150 place count 134 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 130 transition count 121
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 167 place count 130 transition count 112
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 176 place count 121 transition count 112
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 193 place count 121 transition count 112
Applied a total of 193 rules in 36 ms. Remains 121 /210 variables (removed 89) and now considering 112/197 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 121/210 places, 112/197 transitions.
Incomplete random walk after 10000 steps, including 944 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 560 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10000 steps, including 662 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 681 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 659 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 671 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 681 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 683 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 663 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 112 rows 121 cols
[2024-05-22 23:56:53] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 23:56:53] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 23:56:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-22 23:56:53] [INFO ] [Nat]Absence check using 8 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:56:53] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 23:56:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 23:56:53] [INFO ] After 87ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-22 23:56:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 23:56:53] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-22 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-22 23:56:53] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-22 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 23:56:53] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-22 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 23:56:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-22 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 23:56:53] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-22 23:56:54] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 144 ms.
Support contains 12 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 112/112 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 111
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 120 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 119 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 119 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 118 transition count 109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 18 place count 112 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 110 transition count 103
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 110 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 32 place count 105 transition count 98
Applied a total of 32 rules in 17 ms. Remains 105 /121 variables (removed 16) and now considering 98/112 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 105/121 places, 98/112 transitions.
Incomplete random walk after 10000 steps, including 1135 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 753 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 785 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 785 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 762 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 797 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 790 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 775 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 350523 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{2=1, 3=1, 6=1}
Probabilistic random walk after 350523 steps, saw 175340 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :3
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:56:57] [INFO ] Computed 20 invariants in 3 ms
[2024-05-22 23:56:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 23:56:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 23:56:57] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-22 23:56:57] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 23:56:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 23:56:57] [INFO ] After 44ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 23:56:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-22 23:56:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-22 23:56:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2024-05-22 23:56:58] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 23:56:58] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 23:56:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-22 23:56:58] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 23:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-22 23:56:58] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-22 23:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-22 23:56:58] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-22 23:56:58] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 64 ms.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 98/98 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 94
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 101 transition count 94
Applied a total of 10 rules in 13 ms. Remains 101 /105 variables (removed 4) and now considering 94/98 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 101/105 places, 94/98 transitions.
Incomplete random walk after 10000 steps, including 1115 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 768 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 775 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 785 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 777 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 355536 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355536 steps, saw 177870 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 94 rows 101 cols
[2024-05-22 23:57:01] [INFO ] Computed 20 invariants in 2 ms
[2024-05-22 23:57:01] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 23:57:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:57:02] [INFO ] [Nat]Absence check using 5 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 23:57:02] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 23:57:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 23:57:02] [INFO ] After 37ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 23:57:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-22 23:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-22 23:57:02] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-22 23:57:02] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 104 ms.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-22 23:57:02] [INFO ] Invariant cache hit.
[2024-05-22 23:57:02] [INFO ] Implicit Places using invariants in 80 ms returned [48, 53, 69, 74, 92, 98]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 81 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 95/101 places, 94/94 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 92
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 93 transition count 92
Applied a total of 5 rules in 9 ms. Remains 93 /95 variables (removed 2) and now considering 92/94 (removed 2) transitions.
// Phase 1: matrix 92 rows 93 cols
[2024-05-22 23:57:02] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 23:57:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:57:02] [INFO ] Invariant cache hit.
[2024-05-22 23:57:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 23:57:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/101 places, 92/94 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 342 ms. Remains : 93/101 places, 92/94 transitions.
Incomplete random walk after 10000 steps, including 1246 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 326648 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326648 steps, saw 163385 distinct states, run finished after 3003 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 23:57:06] [INFO ] Invariant cache hit.
[2024-05-22 23:57:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 23:57:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 23:57:06] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-22 23:57:06] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 23:57:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 23:57:06] [INFO ] After 43ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 23:57:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 23:57:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 23:57:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 23:57:06] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-22 23:57:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 170 ms
[2024-05-22 23:57:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 23:57:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 23:57:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-05-22 23:57:06] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-22 23:57:06] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 50 ms.
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 93/93 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-22 23:57:06] [INFO ] Invariant cache hit.
[2024-05-22 23:57:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 23:57:06] [INFO ] Invariant cache hit.
[2024-05-22 23:57:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 23:57:06] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-22 23:57:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:57:06] [INFO ] Invariant cache hit.
[2024-05-22 23:57:07] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 93/93 places, 92/92 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 93 transition count 85
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 86 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 84 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 84 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 82 transition count 81
Applied a total of 22 rules in 10 ms. Remains 82 /93 variables (removed 11) and now considering 81/92 (removed 11) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 81 rows 82 cols
[2024-05-22 23:57:07] [INFO ] Computed 15 invariants in 5 ms
[2024-05-22 23:57:07] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 23:57:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 23:57:07] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 23:57:07] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 23:57:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 23:57:07] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-22 23:57:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 4 ms to minimize.
[2024-05-22 23:57:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2024-05-22 23:57:07] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-22 23:57:07] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
FORMULA DoubleExponent-PT-004-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 210 vertex of which 208 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
FORMULA DoubleExponent-PT-004-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 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
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 44 rules applied. Total rules applied 45 place count 209 transition count 152
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 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 91 place count 164 transition count 151
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 91 place count 164 transition count 142
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 109 place count 155 transition count 142
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 187 place count 116 transition count 103
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 199 place count 110 transition count 103
Applied a total of 199 rules in 18 ms. Remains 110 /210 variables (removed 100) and now considering 103/197 (removed 94) transitions.
// Phase 1: matrix 103 rows 110 cols
[2024-05-22 23:57:07] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 23:57:07] [INFO ] Implicit Places using invariants in 69 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/210 places, 103/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 101
Applied a total of 4 rules in 5 ms. Remains 107 /109 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-22 23:57:07] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 23:57:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:57:07] [INFO ] Invariant cache hit.
[2024-05-22 23:57:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 23:57:07] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/210 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 107/210 places, 101/197 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s33 s94)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9824 reset in 211 ms.
Product exploration explored 100000 steps with 9814 reset in 131 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 328 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 357 steps, including 33 resets, run visited all 1 properties in 1 ms. (steps per millisecond=357 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Applied a total of 0 rules in 15 ms. Remains 107 /107 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-22 23:57:08] [INFO ] Invariant cache hit.
[2024-05-22 23:57:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 23:57:09] [INFO ] Invariant cache hit.
[2024-05-22 23:57:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 23:57:09] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-22 23:57:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:57:09] [INFO ] Invariant cache hit.
[2024-05-22 23:57:09] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 107/107 places, 101/101 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 328 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9796 reset in 89 ms.
Product exploration explored 100000 steps with 9811 reset in 86 ms.
Built C files in :
/tmp/ltsmin3874208864874871617
[2024-05-22 23:57:10] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-22 23:57:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:57:10] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-22 23:57:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:57:10] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-22 23:57:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:57:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3874208864874871617
Running compilation step : cd /tmp/ltsmin3874208864874871617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 299 ms.
Running link step : cd /tmp/ltsmin3874208864874871617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3874208864874871617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5334199061762266011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-22 23:57:25] [INFO ] Invariant cache hit.
[2024-05-22 23:57:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 23:57:25] [INFO ] Invariant cache hit.
[2024-05-22 23:57:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 23:57:25] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-22 23:57:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:57:25] [INFO ] Invariant cache hit.
[2024-05-22 23:57:25] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 107/107 places, 101/101 transitions.
Built C files in :
/tmp/ltsmin1969602992557031587
[2024-05-22 23:57:25] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-22 23:57:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:57:25] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-22 23:57:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:57:25] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-22 23:57:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:57:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1969602992557031587
Running compilation step : cd /tmp/ltsmin1969602992557031587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 214 ms.
Running link step : cd /tmp/ltsmin1969602992557031587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1969602992557031587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5128165728350039229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 23:57:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:57:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:57:40] [INFO ] Time to serialize gal into /tmp/LTL116047504355924165.gal : 2 ms
[2024-05-22 23:57:40] [INFO ] Time to serialize properties into /tmp/LTL6259482461172292151.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL116047504355924165.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5260436843687623242.hoa' '-atoms' '/tmp/LTL6259482461172292151.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6259482461172292151.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5260436843687623242.hoa
Detected timeout of ITS tools.
[2024-05-22 23:57:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:57:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:57:55] [INFO ] Time to serialize gal into /tmp/LTL9804941798271963339.gal : 2 ms
[2024-05-22 23:57:55] [INFO ] Time to serialize properties into /tmp/LTL143397517663692941.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9804941798271963339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL143397517663692941.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(p15<=p8)"))))
Formula 0 simplified : FG!"(p15<=p8)"
Detected timeout of ITS tools.
[2024-05-22 23:58:10] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:58:10] [INFO ] Applying decomposition
[2024-05-22 23:58:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13276703865857227520.txt' '-o' '/tmp/graph13276703865857227520.bin' '-w' '/tmp/graph13276703865857227520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13276703865857227520.bin' '-l' '-1' '-v' '-w' '/tmp/graph13276703865857227520.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:58:10] [INFO ] Decomposing Gal with order
[2024-05-22 23:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:58:10] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-22 23:58:10] [INFO ] Flatten gal took : 37 ms
[2024-05-22 23:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 23:58:10] [INFO ] Time to serialize gal into /tmp/LTL1904524099092673521.gal : 3 ms
[2024-05-22 23:58:10] [INFO ] Time to serialize properties into /tmp/LTL18360171354908115012.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1904524099092673521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18360171354908115012.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu12.p15<=gu12.p8)"))))
Formula 0 simplified : FG!"(gu12.p15<=gu12.p8)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9128774351024782708
[2024-05-22 23:58:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9128774351024782708
Running compilation step : cd /tmp/ltsmin9128774351024782708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin9128774351024782708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9128774351024782708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLCardinality-02 finished in 93555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 11 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2024-05-22 23:58:41] [INFO ] Computed 20 invariants in 7 ms
[2024-05-22 23:58:41] [INFO ] Implicit Places using invariants in 100 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s166 s205)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-03 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 208 transition count 149
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 162 transition count 149
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 93 place count 162 transition count 141
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 109 place count 154 transition count 141
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 187 place count 115 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 199 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 108 transition count 101
Applied a total of 200 rules in 28 ms. Remains 108 /210 variables (removed 102) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 108 cols
[2024-05-22 23:58:41] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 23:58:41] [INFO ] Implicit Places using invariants in 66 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/210 places, 101/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 99
Applied a total of 4 rules in 5 ms. Remains 105 /107 variables (removed 2) and now considering 99/101 (removed 2) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-22 23:58:41] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 23:58:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 23:58:41] [INFO ] Invariant cache hit.
[2024-05-22 23:58:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:58:41] [INFO ] Implicit Places using invariants and state equation in 149 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 : 105/210 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 105/210 places, 99/197 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s47 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11349 reset in 97 ms.
Product exploration explored 100000 steps with 11365 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 315 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 10 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 23:58:42] [INFO ] Invariant cache hit.
[2024-05-22 23:58:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 23:58:42] [INFO ] Invariant cache hit.
[2024-05-22 23:58:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:58:42] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-22 23:58:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:58:42] [INFO ] Invariant cache hit.
[2024-05-22 23:58:42] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 105/105 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 315 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11522 reset in 85 ms.
Product exploration explored 100000 steps with 11366 reset in 94 ms.
Built C files in :
/tmp/ltsmin10939859644645556286
[2024-05-22 23:58:43] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-22 23:58:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:58:43] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-22 23:58:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:58:43] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-22 23:58:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:58:43] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10939859644645556286
Running compilation step : cd /tmp/ltsmin10939859644645556286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 214 ms.
Running link step : cd /tmp/ltsmin10939859644645556286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10939859644645556286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6320060328343133613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 15 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-22 23:58:58] [INFO ] Invariant cache hit.
[2024-05-22 23:58:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 23:58:58] [INFO ] Invariant cache hit.
[2024-05-22 23:58:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:58:58] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-22 23:58:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:58:58] [INFO ] Invariant cache hit.
[2024-05-22 23:58:58] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 105/105 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin11440651869708556277
[2024-05-22 23:58:58] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-22 23:58:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:58:58] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-22 23:58:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:58:58] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-22 23:58:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:58:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11440651869708556277
Running compilation step : cd /tmp/ltsmin11440651869708556277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 205 ms.
Running link step : cd /tmp/ltsmin11440651869708556277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11440651869708556277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13446898603188117563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 23:59:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:59:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:13] [INFO ] Time to serialize gal into /tmp/LTL507882741966681167.gal : 2 ms
[2024-05-22 23:59:13] [INFO ] Time to serialize properties into /tmp/LTL500822418630236542.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL507882741966681167.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12893696888690604084.hoa' '-atoms' '/tmp/LTL500822418630236542.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL500822418630236542.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12893696888690604084.hoa
Detected timeout of ITS tools.
[2024-05-22 23:59:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:59:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:28] [INFO ] Time to serialize gal into /tmp/LTL12616909819196016024.gal : 2 ms
[2024-05-22 23:59:28] [INFO ] Time to serialize properties into /tmp/LTL13255299079160948012.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12616909819196016024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13255299079160948012.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p17<=p100)"))))
Formula 0 simplified : GF!"(p17<=p100)"
Detected timeout of ITS tools.
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:59:43] [INFO ] Applying decomposition
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2857583189947915874.txt' '-o' '/tmp/graph2857583189947915874.bin' '-w' '/tmp/graph2857583189947915874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2857583189947915874.bin' '-l' '-1' '-v' '-w' '/tmp/graph2857583189947915874.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:59:43] [INFO ] Decomposing Gal with order
[2024-05-22 23:59:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:59:43] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:59:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 23:59:43] [INFO ] Time to serialize gal into /tmp/LTL16717347070793870128.gal : 2 ms
[2024-05-22 23:59:43] [INFO ] Time to serialize properties into /tmp/LTL7248184124298429667.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16717347070793870128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7248184124298429667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu16.p17<=gu16.p100)"))))
Formula 0 simplified : GF!"(gu16.p17<=gu16.p100)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7804004935678455041
[2024-05-22 23:59:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7804004935678455041
Running compilation step : cd /tmp/ltsmin7804004935678455041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin7804004935678455041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7804004935678455041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLCardinality-04 finished in 92638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2024-05-23 00:00:14] [INFO ] Computed 20 invariants in 5 ms
[2024-05-23 00:00:14] [INFO ] Implicit Places using invariants in 84 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s174 s180), p0:(LEQ s163 s191)], 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]]
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Product exploration explored 100000 steps with 33333 reset in 131 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.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLCardinality-05 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U (p2||G(p1))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-23 00:00:14] [INFO ] Invariant cache hit.
[2024-05-23 00:00:14] [INFO ] Implicit Places using invariants in 75 ms returned [84]
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 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (GT 3 s25) (GT s121 s0)), p1:(GT s121 s0), p0:(GT 1 s168)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-06 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-23 00:00:14] [INFO ] Invariant cache hit.
[2024-05-23 00:00:14] [INFO ] Implicit Places using invariants in 79 ms returned [84]
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 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s150 s186)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-07 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 208 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 161 transition count 148
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 95 place count 161 transition count 139
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 113 place count 152 transition count 139
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 183 place count 117 transition count 104
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 195 place count 111 transition count 104
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 111 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 110 transition count 103
Applied a total of 197 rules in 24 ms. Remains 110 /210 variables (removed 100) and now considering 103/197 (removed 94) transitions.
// Phase 1: matrix 103 rows 110 cols
[2024-05-23 00:00:15] [INFO ] Computed 20 invariants in 2 ms
[2024-05-23 00:00:15] [INFO ] Implicit Places using invariants in 66 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/210 places, 103/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 101
Applied a total of 4 rules in 4 ms. Remains 107 /109 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-23 00:00:15] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:00:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 00:00:15] [INFO ] Invariant cache hit.
[2024-05-23 00:00:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:00:15] [INFO ] Implicit Places using invariants and state equation in 140 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 : 107/210 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 310 ms. Remains : 107/210 places, 101/197 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s29), p0:(LEQ s55 s103)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLCardinality-10 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 208 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 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 95 place count 161 transition count 140
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 153 transition count 140
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 187 place count 115 transition count 102
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 199 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 108 transition count 101
Applied a total of 200 rules in 17 ms. Remains 108 /210 variables (removed 102) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 108 cols
[2024-05-23 00:00:15] [INFO ] Computed 20 invariants in 3 ms
[2024-05-23 00:00:15] [INFO ] Implicit Places using invariants in 62 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/210 places, 101/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 99
Applied a total of 4 rules in 4 ms. Remains 105 /107 variables (removed 2) and now considering 99/101 (removed 2) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-23 00:00:15] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:00:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 00:00:15] [INFO ] Invariant cache hit.
[2024-05-23 00:00:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:00:15] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/210 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 303 ms. Remains : 105/210 places, 99/197 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s46 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13980 reset in 87 ms.
Product exploration explored 100000 steps with 13860 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1387 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1098909 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :{}
Probabilistic random walk after 1098909 steps, saw 549626 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:00:19] [INFO ] Invariant cache hit.
[2024-05-23 00:00:19] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:00:19] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-23 00:00:19] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:00:19] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:19] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:00:19] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 99/99 transitions.
Graph (complete) has 302 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 98
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 14 place count 104 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 92 transition count 86
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 41 place count 92 transition count 86
Applied a total of 41 rules in 15 ms. Remains 92 /105 variables (removed 13) and now considering 86/99 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 92/105 places, 86/99 transitions.
Incomplete random walk after 10000 steps, including 1221 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1176745 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :{}
Probabilistic random walk after 1176745 steps, saw 588629 distinct states, run finished after 3001 ms. (steps per millisecond=392 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 92 cols
[2024-05-23 00:00:22] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:00:22] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:00:22] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-23 00:00:22] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:22] [INFO ] After 17ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:22] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 00:00:22] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 92/92 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-23 00:00:22] [INFO ] Invariant cache hit.
[2024-05-23 00:00:22] [INFO ] Implicit Places using invariants in 70 ms returned [21, 27, 60, 65, 83, 89]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/92 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 86 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 83
Applied a total of 6 rules in 3 ms. Remains 83 /86 variables (removed 3) and now considering 83/86 (removed 3) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-23 00:00:22] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:00:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 00:00:22] [INFO ] Invariant cache hit.
[2024-05-23 00:00:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:22] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/92 places, 83/86 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 307 ms. Remains : 83/92 places, 83/86 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1262027 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :{}
Probabilistic random walk after 1262027 steps, saw 631015 distinct states, run finished after 3001 ms. (steps per millisecond=420 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:00:25] [INFO ] Invariant cache hit.
[2024-05-23 00:00:25] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:00:25] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:00:25] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:25] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:25] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:00:26] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-23 00:00:26] [INFO ] Invariant cache hit.
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 00:00:26] [INFO ] Invariant cache hit.
[2024-05-23 00:00:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-23 00:00:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:00:26] [INFO ] Invariant cache hit.
[2024-05-23 00:00:26] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 83/83 places, 83/83 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 83 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 74 transition count 74
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 20 place count 73 transition count 73
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 5 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2024-05-23 00:00:26] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:00:26] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:00:26] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:00:26] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:26] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 00:00:26] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-23 00:00:26] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 00:00:26] [INFO ] Invariant cache hit.
[2024-05-23 00:00:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-23 00:00:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:00:26] [INFO ] Invariant cache hit.
[2024-05-23 00:00:26] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 105/105 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1347 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 813 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1118147 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :{}
Probabilistic random walk after 1118147 steps, saw 559068 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:00:30] [INFO ] Invariant cache hit.
[2024-05-23 00:00:30] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:00:30] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-23 00:00:30] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:00:30] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:30] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:00:30] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 99/99 transitions.
Graph (complete) has 302 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 98
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 14 place count 104 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 92 transition count 86
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 41 place count 92 transition count 86
Applied a total of 41 rules in 7 ms. Remains 92 /105 variables (removed 13) and now considering 86/99 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 92/105 places, 86/99 transitions.
Incomplete random walk after 10000 steps, including 1309 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 839 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1146066 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1146066 steps, saw 573357 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 92 cols
[2024-05-23 00:00:33] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 00:00:33] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:00:33] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-23 00:00:33] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:33] [INFO ] After 18ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:33] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:00:33] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 92/92 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-23 00:00:33] [INFO ] Invariant cache hit.
[2024-05-23 00:00:33] [INFO ] Implicit Places using invariants in 73 ms returned [21, 27, 60, 65, 83, 89]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/92 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 86 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 83
Applied a total of 6 rules in 4 ms. Remains 83 /86 variables (removed 3) and now considering 83/86 (removed 3) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-23 00:00:33] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:00:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 00:00:33] [INFO ] Invariant cache hit.
[2024-05-23 00:00:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:33] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/92 places, 83/86 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 322 ms. Remains : 83/92 places, 83/86 transitions.
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1261076 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :{}
Probabilistic random walk after 1261076 steps, saw 630538 distinct states, run finished after 3001 ms. (steps per millisecond=420 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:00:36] [INFO ] Invariant cache hit.
[2024-05-23 00:00:36] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:00:36] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:00:36] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:36] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:36] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:00:36] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-23 00:00:36] [INFO ] Invariant cache hit.
[2024-05-23 00:00:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:00:36] [INFO ] Invariant cache hit.
[2024-05-23 00:00:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:00:37] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-23 00:00:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:00:37] [INFO ] Invariant cache hit.
[2024-05-23 00:00:37] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 83/83 places, 83/83 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 83 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 74 transition count 74
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 20 place count 73 transition count 73
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 12 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2024-05-23 00:00:37] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:00:37] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:00:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 00:00:37] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:00:37] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:00:37] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 00:00:37] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13817 reset in 88 ms.
Product exploration explored 100000 steps with 13865 reset in 93 ms.
Built C files in :
/tmp/ltsmin7761741660950935742
[2024-05-23 00:00:37] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:00:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:00:37] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:00:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:00:37] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:00:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:00:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7761741660950935742
Running compilation step : cd /tmp/ltsmin7761741660950935742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 217 ms.
Running link step : cd /tmp/ltsmin7761741660950935742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7761741660950935742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12920506619814108056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-23 00:00:52] [INFO ] Computed 19 invariants in 4 ms
[2024-05-23 00:00:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 00:00:53] [INFO ] Invariant cache hit.
[2024-05-23 00:00:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:00:53] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-23 00:00:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:00:53] [INFO ] Invariant cache hit.
[2024-05-23 00:00:53] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 105/105 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin18219414427063042485
[2024-05-23 00:00:53] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:00:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:00:53] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:00:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:00:53] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:00:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:00:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18219414427063042485
Running compilation step : cd /tmp/ltsmin18219414427063042485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin18219414427063042485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18219414427063042485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3872834404234596650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:01:08] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:01:08] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:01:08] [INFO ] Time to serialize gal into /tmp/LTL6063991177018281627.gal : 1 ms
[2024-05-23 00:01:08] [INFO ] Time to serialize properties into /tmp/LTL11765103204685903807.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6063991177018281627.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11288498997299083234.hoa' '-atoms' '/tmp/LTL11765103204685903807.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11765103204685903807.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11288498997299083234.hoa
Detected timeout of ITS tools.
[2024-05-23 00:01:23] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:01:23] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:01:23] [INFO ] Time to serialize gal into /tmp/LTL14109008495413579310.gal : 1 ms
[2024-05-23 00:01:23] [INFO ] Time to serialize properties into /tmp/LTL2855591163241150059.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14109008495413579310.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2855591163241150059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p170<=p200)"))))
Formula 0 simplified : FG!"(p170<=p200)"
Detected timeout of ITS tools.
[2024-05-23 00:01:38] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:01:38] [INFO ] Applying decomposition
[2024-05-23 00:01:38] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1233840797633474213.txt' '-o' '/tmp/graph1233840797633474213.bin' '-w' '/tmp/graph1233840797633474213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1233840797633474213.bin' '-l' '-1' '-v' '-w' '/tmp/graph1233840797633474213.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:01:38] [INFO ] Decomposing Gal with order
[2024-05-23 00:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:01:38] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-23 00:01:38] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-23 00:01:38] [INFO ] Time to serialize gal into /tmp/LTL9086420761647073207.gal : 1 ms
[2024-05-23 00:01:38] [INFO ] Time to serialize properties into /tmp/LTL7681587529599790580.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9086420761647073207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7681587529599790580.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu22.p170<=gu22.p200)"))))
Formula 0 simplified : FG!"(gu22.p170<=gu22.p200)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12397012432402601138
[2024-05-23 00:01:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12397012432402601138
Running compilation step : cd /tmp/ltsmin12397012432402601138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin12397012432402601138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12397012432402601138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLCardinality-13 finished in 113316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2024-05-23 00:02:08] [INFO ] Computed 20 invariants in 2 ms
[2024-05-23 00:02:08] [INFO ] Implicit Places using invariants in 81 ms returned [84]
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 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s77 s68)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3336 reset in 90 ms.
Product exploration explored 100000 steps with 3347 reset in 87 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 898824 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898824 steps, saw 449477 distinct states, run finished after 3004 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:02:12] [INFO ] Computed 19 invariants in 8 ms
[2024-05-23 00:02:12] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:12] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-23 00:02:12] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 0 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2024-05-23 00:02:12] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-23 00:02:12] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 159 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 158 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 100 place count 158 transition count 137
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 118 place count 149 transition count 137
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 194 place count 111 transition count 99
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 206 place count 105 transition count 99
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 217 place count 105 transition count 88
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 228 place count 94 transition count 88
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 244 place count 94 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 93 transition count 87
Applied a total of 245 rules in 16 ms. Remains 93 /209 variables (removed 116) and now considering 87/197 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 93/209 places, 87/197 transitions.
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1144070 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1144070 steps, saw 572372 distinct states, run finished after 3003 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 93 cols
[2024-05-23 00:02:15] [INFO ] Computed 19 invariants in 4 ms
[2024-05-23 00:02:15] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:02:15] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:15] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:15] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:15] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:02:15] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 93/93 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-23 00:02:15] [INFO ] Invariant cache hit.
[2024-05-23 00:02:15] [INFO ] Implicit Places using invariants in 74 ms returned [61, 66, 84, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/93 places, 87/87 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 85
Applied a total of 4 rules in 3 ms. Remains 87 /89 variables (removed 2) and now considering 85/87 (removed 2) transitions.
// Phase 1: matrix 85 rows 87 cols
[2024-05-23 00:02:15] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 00:02:16] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 00:02:16] [INFO ] Invariant cache hit.
[2024-05-23 00:02:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:16] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/93 places, 85/87 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 295 ms. Remains : 87/93 places, 85/87 transitions.
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1233975 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 1233975 steps, saw 617027 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:02:19] [INFO ] Invariant cache hit.
[2024-05-23 00:02:19] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:19] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:19] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:19] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:19] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-23 00:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-23 00:02:19] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 00:02:19] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-23 00:02:19] [INFO ] Invariant cache hit.
[2024-05-23 00:02:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:02:19] [INFO ] Invariant cache hit.
[2024-05-23 00:02:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:19] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-23 00:02:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:02:19] [INFO ] Invariant cache hit.
[2024-05-23 00:02:19] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 87/87 places, 85/85 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 87 transition count 78
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 78 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 78 transition count 76
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 78 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 76 transition count 74
Applied a total of 22 rules in 4 ms. Remains 76 /87 variables (removed 11) and now considering 74/85 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 76 cols
[2024-05-23 00:02:19] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 00:02:19] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:19] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:19] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:19] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 00:02:19] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
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.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 159 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
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 115 place count 150 transition count 138
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 191 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 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 13 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-23 00:02:19] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:02:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 00:02:19] [INFO ] Invariant cache hit.
[2024-05-23 00:02:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:20] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-23 00:02:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:02:20] [INFO ] Invariant cache hit.
[2024-05-23 00:02:20] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 105/209 places, 99/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1125988 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1125988 steps, saw 562983 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:02:23] [INFO ] Invariant cache hit.
[2024-05-23 00:02:23] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:02:23] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:23] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:23] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:23] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:02:23] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 99/99 transitions.
Graph (complete) has 304 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 98
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 13 place count 104 transition count 87
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 93 transition count 87
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 39 place count 93 transition count 87
Applied a total of 39 rules in 5 ms. Remains 93 /105 variables (removed 12) and now considering 87/99 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/105 places, 87/99 transitions.
Incomplete random walk after 10000 steps, including 1295 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 836 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1143212 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1143212 steps, saw 571933 distinct states, run finished after 3002 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 93 cols
[2024-05-23 00:02:26] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:02:26] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:02:26] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-23 00:02:26] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:26] [INFO ] After 9ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:26] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 00:02:26] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 93/93 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-23 00:02:26] [INFO ] Invariant cache hit.
[2024-05-23 00:02:26] [INFO ] Implicit Places using invariants in 70 ms returned [61, 66, 84, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 81 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/93 places, 87/87 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 85
Applied a total of 4 rules in 3 ms. Remains 87 /89 variables (removed 2) and now considering 85/87 (removed 2) transitions.
// Phase 1: matrix 85 rows 87 cols
[2024-05-23 00:02:26] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 00:02:26] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-23 00:02:26] [INFO ] Invariant cache hit.
[2024-05-23 00:02:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:27] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/93 places, 85/87 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 352 ms. Remains : 87/93 places, 85/87 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1166991 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :{}
Probabilistic random walk after 1166991 steps, saw 583626 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:30] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:30] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:30] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 10 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-23 00:02:30] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 00:02:30] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 00:02:30] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-23 00:02:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 87/87 places, 85/85 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 87 transition count 78
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 78 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 78 transition count 76
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 78 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 76 transition count 74
Applied a total of 22 rules in 3 ms. Remains 76 /87 variables (removed 11) and now considering 74/85 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 76 cols
[2024-05-23 00:02:30] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 00:02:30] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:02:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:02:30] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-23 00:02:30] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:02:30] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:02:30] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13838 reset in 90 ms.
Product exploration explored 100000 steps with 13941 reset in 95 ms.
Built C files in :
/tmp/ltsmin17493597304575938031
[2024-05-23 00:02:31] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:02:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:31] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:02:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:31] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:02:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17493597304575938031
Running compilation step : cd /tmp/ltsmin17493597304575938031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin17493597304575938031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17493597304575938031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17467561542140971347.hoa' '--buchi-type=spotba'
LTSmin run took 1439 ms.
FORMULA DoubleExponent-PT-004-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-004-LTLCardinality-14 finished in 24035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 197/197 transitions.
Graph (complete) has 352 edges and 210 vertex of which 209 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
Reduce places removed 1 places and 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 44 rules applied. Total rules applied 45 place count 208 transition count 151
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 164 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 163 transition count 150
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 91 place count 163 transition count 142
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 107 place count 155 transition count 142
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 181 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 191 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 192 place count 112 transition count 104
Applied a total of 192 rules in 16 ms. Remains 112 /210 variables (removed 98) and now considering 104/197 (removed 93) transitions.
// Phase 1: matrix 104 rows 112 cols
[2024-05-23 00:02:32] [INFO ] Computed 20 invariants in 3 ms
[2024-05-23 00:02:32] [INFO ] Implicit Places using invariants in 70 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/210 places, 104/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 109 transition count 102
Applied a total of 4 rules in 2 ms. Remains 109 /111 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 109 cols
[2024-05-23 00:02:32] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:02:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:02:32] [INFO ] Invariant cache hit.
[2024-05-23 00:02:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:33] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/210 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 109/210 places, 102/197 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s103 s64), p0:(LEQ s72 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13745 reset in 136 ms.
Product exploration explored 100000 steps with 13765 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 321 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 122 steps, including 17 resets, run visited all 3 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-23 00:02:34] [INFO ] Invariant cache hit.
[2024-05-23 00:02:34] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 00:02:34] [INFO ] Invariant cache hit.
[2024-05-23 00:02:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:34] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-23 00:02:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:02:34] [INFO ] Invariant cache hit.
[2024-05-23 00:02:34] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 109/109 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 321 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 47 steps, including 5 resets, run visited all 3 properties in 4 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 13741 reset in 100 ms.
Product exploration explored 100000 steps with 13807 reset in 103 ms.
Built C files in :
/tmp/ltsmin2546223431776758590
[2024-05-23 00:02:35] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-23 00:02:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:35] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-23 00:02:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:35] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-23 00:02:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2546223431776758590
Running compilation step : cd /tmp/ltsmin2546223431776758590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin2546223431776758590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2546223431776758590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14296099462384140128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-23 00:02:50] [INFO ] Invariant cache hit.
[2024-05-23 00:02:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 00:02:50] [INFO ] Invariant cache hit.
[2024-05-23 00:02:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:50] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-23 00:02:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:02:50] [INFO ] Invariant cache hit.
[2024-05-23 00:02:50] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 109/109 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin11129081031104648351
[2024-05-23 00:02:50] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-23 00:02:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:50] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-23 00:02:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:50] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-23 00:02:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:02:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11129081031104648351
Running compilation step : cd /tmp/ltsmin11129081031104648351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin11129081031104648351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11129081031104648351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6773604455668468958.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:03:06] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:03:06] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:03:06] [INFO ] Time to serialize gal into /tmp/LTL16119873483816838994.gal : 10 ms
[2024-05-23 00:03:06] [INFO ] Time to serialize properties into /tmp/LTL5781507046041604462.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16119873483816838994.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12986213691968374021.hoa' '-atoms' '/tmp/LTL5781507046041604462.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5781507046041604462.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12986213691968374021.hoa
Detected timeout of ITS tools.
[2024-05-23 00:03:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:03:21] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:03:21] [INFO ] Time to serialize gal into /tmp/LTL11109203379100776147.gal : 1 ms
[2024-05-23 00:03:21] [INFO ] Time to serialize properties into /tmp/LTL2130042837587809728.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11109203379100776147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2130042837587809728.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p39<=p192)"))||(("(p39<=p192)")&&(F("(p92>p24)")))))))
Formula 0 simplified : G(F!"(p39<=p192)" & F(G!"(p92>p24)" | G!"(p39<=p192)"))
Detected timeout of ITS tools.
[2024-05-23 00:03:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:03:36] [INFO ] Applying decomposition
[2024-05-23 00:03:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10209544618325505176.txt' '-o' '/tmp/graph10209544618325505176.bin' '-w' '/tmp/graph10209544618325505176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10209544618325505176.bin' '-l' '-1' '-v' '-w' '/tmp/graph10209544618325505176.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:03:36] [INFO ] Decomposing Gal with order
[2024-05-23 00:03:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:03:36] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-23 00:03:36] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:03:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-23 00:03:36] [INFO ] Time to serialize gal into /tmp/LTL18151361225042321567.gal : 1 ms
[2024-05-23 00:03:36] [INFO ] Time to serialize properties into /tmp/LTL4416984158986243815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18151361225042321567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4416984158986243815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(gu29.p39<=gu29.p192)"))||(("(gu29.p39<=gu29.p192)")&&(F("(gu25.p92>gu25.p24)")))))))
Formula 0 simplified : G(F!"(gu29.p39<=gu29.p192)" & F(G!"(gu25.p92>gu25.p24)" | G!"(gu29.p39<=gu29.p192)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9944216147890341950
[2024-05-23 00:03:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9944216147890341950
Running compilation step : cd /tmp/ltsmin9944216147890341950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin9944216147890341950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9944216147890341950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLCardinality-15 finished in 93578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
[2024-05-23 00:04:06] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin993019538980681301
[2024-05-23 00:04:06] [INFO ] Applying decomposition
[2024-05-23 00:04:06] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2024-05-23 00:04:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:06] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2024-05-23 00:04:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:06] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:04:06] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2024-05-23 00:04:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:06] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin993019538980681301
Running compilation step : cd /tmp/ltsmin993019538980681301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph935881955950433751.txt' '-o' '/tmp/graph935881955950433751.bin' '-w' '/tmp/graph935881955950433751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph935881955950433751.bin' '-l' '-1' '-v' '-w' '/tmp/graph935881955950433751.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:04:06] [INFO ] Decomposing Gal with order
[2024-05-23 00:04:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:04:06] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-23 00:04:06] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 9 ms.
[2024-05-23 00:04:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality1522938623309739236.gal : 3 ms
[2024-05-23 00:04:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality2099028838087278629.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1522938623309739236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2099028838087278629.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !((G(F("(gi4.gu22.p15<=gi4.gu22.p8)"))))
Formula 0 simplified : FG!"(gi4.gu22.p15<=gi4.gu22.p8)"
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin993019538980681301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin993019538980681301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.225: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.240: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.254: Initializing POR dependencies: labels 202, guards 197
pins2lts-mc-linux64( 5/ 8), 0.256: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.252: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.269: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.482: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.482: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.483: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.550: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.556: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.563: There are 204 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.563: State length is 211, there are 200 groups
pins2lts-mc-linux64( 0/ 8), 0.563: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.563: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.563: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.563: Visible groups: 0 / 200, labels: 1 / 204
pins2lts-mc-linux64( 0/ 8), 0.563: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.563: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.583: [Blue] ~102 levels ~960 states ~1072 transitions
pins2lts-mc-linux64( 7/ 8), 0.595: [Blue] ~184 levels ~1920 states ~2144 transitions
pins2lts-mc-linux64( 3/ 8), 0.609: [Blue] ~290 levels ~3840 states ~4296 transitions
pins2lts-mc-linux64( 7/ 8), 0.644: [Blue] ~516 levels ~7680 states ~8608 transitions
pins2lts-mc-linux64( 0/ 8), 0.700: [Blue] ~1097 levels ~15360 states ~17096 transitions
pins2lts-mc-linux64( 3/ 8), 0.831: [Blue] ~1077 levels ~30720 states ~34312 transitions
pins2lts-mc-linux64( 3/ 8), 1.068: [Blue] ~1277 levels ~61440 states ~68568 transitions
pins2lts-mc-linux64( 3/ 8), 1.503: [Blue] ~1444 levels ~122880 states ~137104 transitions
pins2lts-mc-linux64( 3/ 8), 2.285: [Blue] ~1620 levels ~245760 states ~274256 transitions
pins2lts-mc-linux64( 3/ 8), 3.655: [Blue] ~2312 levels ~491520 states ~548216 transitions
pins2lts-mc-linux64( 3/ 8), 5.961: [Blue] ~3505 levels ~983040 states ~1095864 transitions
pins2lts-mc-linux64( 3/ 8), 9.725: [Blue] ~5765 levels ~1966080 states ~2189952 transitions
pins2lts-mc-linux64( 5/ 8), 17.195: [Blue] ~10889 levels ~3932160 states ~4391576 transitions
pins2lts-mc-linux64( 5/ 8), 31.847: [Blue] ~24002 levels ~7864320 states ~8768544 transitions
pins2lts-mc-linux64( 0/ 8), 61.561: [Blue] ~170661 levels ~15728640 states ~17452328 transitions
pins2lts-mc-linux64( 0/ 8), 120.247: [Blue] ~335031 levels ~31457280 states ~34902768 transitions
pins2lts-mc-linux64( 0/ 8), 239.471: [Blue] ~482704 levels ~62914560 states ~69789096 transitions
pins2lts-mc-linux64( 3/ 8), 476.982: [Blue] ~20397 levels ~125829120 states ~139508632 transitions
pins2lts-mc-linux64( 4/ 8), 563.941: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 563.973:
pins2lts-mc-linux64( 0/ 8), 563.973: Explored 145024138 states 160699467 transitions, fanout: 1.108
pins2lts-mc-linux64( 0/ 8), 563.973: Total exploration time 563.390 sec (563.350 sec minimum, 563.367 sec on average)
pins2lts-mc-linux64( 0/ 8), 563.973: States per second: 257413, Transitions per second: 285237
pins2lts-mc-linux64( 0/ 8), 563.973:
pins2lts-mc-linux64( 0/ 8), 563.973: State space has 134217141 states, 1 are accepting
pins2lts-mc-linux64( 0/ 8), 563.973: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 563.973: blue states: 145024138 (108.05%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 563.973: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 563.973: all-red states: 1 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 563.973:
pins2lts-mc-linux64( 0/ 8), 563.973: Total memory used for local state coloring: 32.6MB
pins2lts-mc-linux64( 0/ 8), 563.973:
pins2lts-mc-linux64( 0/ 8), 563.973: Queue width: 8B, total height: 2137532, memory: 16.31MB
pins2lts-mc-linux64( 0/ 8), 563.973: Tree memory: 1078.3MB, 8.4 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 563.973: Tree fill ratio (roots/leafs): 99.0%/21.0%
pins2lts-mc-linux64( 0/ 8), 563.973: Stored 197 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 563.973: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 563.973: Est. total memory use: 1094.6MB (~1040.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin993019538980681301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin993019538980681301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-23 00:26:33] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:26:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality10279398200831948318.gal : 2 ms
[2024-05-23 00:26:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality15025782789973738176.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10279398200831948318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15025782789973738176.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !((G(F("(p15<=p8)"))))
Formula 0 simplified : FG!"(p15<=p8)"
Detected timeout of ITS tools.
[2024-05-23 00:48:59] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:48:59] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-23 00:48:59] [INFO ] Transformed 210 places.
[2024-05-23 00:48:59] [INFO ] Transformed 197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 00:48:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality13969660739240411673.gal : 1 ms
[2024-05-23 00:48:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality12737200577214910308.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13969660739240411673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12737200577214910308.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p15<=p8)"))))
Formula 0 simplified : FG!"(p15<=p8)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12467800 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038696 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151600342"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;