Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680849212572

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 06:33:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 06:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 06:33:34] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-04-07 06:33:34] [INFO ] Transformed 891 places.
[2023-04-07 06:33:34] [INFO ] Transformed 3888 transitions.
[2023-04-07 06:33:34] [INFO ] Found NUPN structural information;
[2023-04-07 06:33:34] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 823 transition count 3276
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 823 transition count 3276
Applied a total of 136 rules in 183 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2023-04-07 06:33:35] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2023-04-07 06:33:35] [INFO ] Computed 28 invariants in 28 ms
[2023-04-07 06:33:36] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-04-07 06:33:36] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-07 06:33:36] [INFO ] Invariant cache hit.
[2023-04-07 06:33:36] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-07 06:33:39] [INFO ] Implicit Places using invariants and state equation in 2963 ms returned []
Implicit Place search using SMT with State Equation took 3957 ms to find 0 implicit places.
[2023-04-07 06:33:39] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-07 06:33:39] [INFO ] Invariant cache hit.
[2023-04-07 06:33:40] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 823/891 places, 3276/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5281 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 63 out of 823 places after structural reductions.
[2023-04-07 06:33:40] [INFO ] Flatten gal took : 206 ms
[2023-04-07 06:33:41] [INFO ] Flatten gal took : 171 ms
[2023-04-07 06:33:41] [INFO ] Input system was already deterministic with 3276 transitions.
Support contains 59 out of 823 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 33) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-04-07 06:33:42] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-07 06:33:42] [INFO ] Invariant cache hit.
[2023-04-07 06:33:43] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2023-04-07 06:33:43] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:33:43] [INFO ] After 853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 06:33:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2023-04-07 06:33:43] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 06:33:46] [INFO ] After 1798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 06:33:46] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-07 06:33:48] [INFO ] After 2160ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 06:33:48] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 8 ms to minimize.
[2023-04-07 06:33:48] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 2 ms to minimize.
[2023-04-07 06:33:49] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-04-07 06:33:49] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 26 ms to minimize.
[2023-04-07 06:33:49] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 1 ms to minimize.
[2023-04-07 06:33:50] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2023-04-07 06:33:50] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2023-04-07 06:33:50] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2023-04-07 06:33:50] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-04-07 06:33:50] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-07 06:33:50] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-04-07 06:33:51] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-07 06:33:51] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 06:33:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3017 ms
[2023-04-07 06:33:51] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 0 ms to minimize.
[2023-04-07 06:33:51] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2023-04-07 06:33:51] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-04-07 06:33:52] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-04-07 06:33:52] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 0 ms to minimize.
[2023-04-07 06:33:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 952 ms
[2023-04-07 06:33:52] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 0 ms to minimize.
[2023-04-07 06:33:52] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:33:52] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2023-04-07 06:33:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2023-04-07 06:33:53] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2023-04-07 06:33:53] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 1 ms to minimize.
[2023-04-07 06:33:53] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 0 ms to minimize.
[2023-04-07 06:33:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 594 ms
[2023-04-07 06:33:53] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2023-04-07 06:33:54] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 1 ms to minimize.
[2023-04-07 06:33:54] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2023-04-07 06:33:54] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2023-04-07 06:33:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 782 ms
[2023-04-07 06:33:54] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2023-04-07 06:33:54] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2023-04-07 06:33:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2023-04-07 06:33:55] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 0 ms to minimize.
[2023-04-07 06:33:55] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2023-04-07 06:33:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2023-04-07 06:33:55] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2023-04-07 06:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-04-07 06:33:55] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2023-04-07 06:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-04-07 06:33:56] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2023-04-07 06:33:56] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2023-04-07 06:33:56] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2023-04-07 06:33:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 471 ms
[2023-04-07 06:33:56] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-07 06:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-07 06:33:57] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2023-04-07 06:33:57] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2023-04-07 06:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2023-04-07 06:33:57] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 15 ms to minimize.
[2023-04-07 06:33:58] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2023-04-07 06:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2023-04-07 06:33:59] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 0 ms to minimize.
[2023-04-07 06:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-04-07 06:33:59] [INFO ] After 13640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 2840 ms.
[2023-04-07 06:34:02] [INFO ] After 19192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 437 ms.
Support contains 56 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 823 transition count 3268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 815 transition count 3268
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 247 Pre rules applied. Total rules applied 16 place count 815 transition count 3021
Deduced a syphon composed of 247 places in 5 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 2 with 494 rules applied. Total rules applied 510 place count 568 transition count 3021
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 7 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 654 place count 496 transition count 2949
Applied a total of 654 rules in 521 ms. Remains 496 /823 variables (removed 327) and now considering 2949/3276 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 496/823 places, 2949/3276 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 149870 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{1=1, 8=1, 9=1, 11=1, 12=1, 17=1, 20=1, 25=1}
Probabilistic random walk after 149870 steps, saw 101982 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :8
Running SMT prover for 20 properties.
[2023-04-07 06:34:06] [INFO ] Flow matrix only has 870 transitions (discarded 2079 similar events)
// Phase 1: matrix 870 rows 496 cols
[2023-04-07 06:34:06] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 06:34:07] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:34:07] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:34:07] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 06:34:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 06:34:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:34:08] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-07 06:34:08] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-07 06:34:09] [INFO ] After 931ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-07 06:34:09] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 1 ms to minimize.
[2023-04-07 06:34:09] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 1 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-04-07 06:34:10] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2023-04-07 06:34:11] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 06:34:11] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2023-04-07 06:34:11] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 7 ms to minimize.
[2023-04-07 06:34:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1945 ms
[2023-04-07 06:34:11] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-07 06:34:11] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 06:34:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-04-07 06:34:11] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-04-07 06:34:12] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-04-07 06:34:12] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2023-04-07 06:34:12] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-04-07 06:34:12] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-04-07 06:34:12] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2023-04-07 06:34:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 941 ms
[2023-04-07 06:34:12] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2023-04-07 06:34:13] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2023-04-07 06:34:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-04-07 06:34:13] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2023-04-07 06:34:13] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2023-04-07 06:34:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2023-04-07 06:34:13] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 738 ms
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2023-04-07 06:34:14] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-04-07 06:34:15] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2023-04-07 06:34:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 533 ms
[2023-04-07 06:34:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-04-07 06:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-07 06:34:15] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:34:15] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-04-07 06:34:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-04-07 06:34:16] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 13 ms to minimize.
[2023-04-07 06:34:16] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2023-04-07 06:34:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-04-07 06:34:16] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2023-04-07 06:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-07 06:34:16] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2023-04-07 06:34:16] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-04-07 06:34:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-04-07 06:34:16] [INFO ] After 8237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1004 ms.
[2023-04-07 06:34:17] [INFO ] After 10468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 221 ms.
Support contains 44 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 2949/2949 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 496 transition count 2945
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 492 transition count 2945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 491 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 491 transition count 2936
Applied a total of 10 rules in 168 ms. Remains 491 /496 variables (removed 5) and now considering 2936/2949 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 491/496 places, 2936/2949 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 125190 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125190 steps, saw 84586 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 20 properties.
[2023-04-07 06:34:21] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
// Phase 1: matrix 857 rows 491 cols
[2023-04-07 06:34:21] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 06:34:21] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 06:34:21] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:34:22] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 06:34:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:34:22] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:34:23] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-07 06:34:23] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-04-07 06:34:24] [INFO ] After 980ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-07 06:34:24] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 0 ms to minimize.
[2023-04-07 06:34:24] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 0 ms to minimize.
[2023-04-07 06:34:25] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2023-04-07 06:34:25] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-07 06:34:25] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-04-07 06:34:25] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-04-07 06:34:25] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1948 ms
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-07 06:34:26] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1028 ms
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-04-07 06:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-04-07 06:34:27] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2023-04-07 06:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-07 06:34:28] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-04-07 06:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-07 06:34:28] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2023-04-07 06:34:28] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-04-07 06:34:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-04-07 06:34:28] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2023-04-07 06:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-07 06:34:29] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-04-07 06:34:29] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-04-07 06:34:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-04-07 06:34:29] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 0 ms to minimize.
[2023-04-07 06:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 06:34:29] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2023-04-07 06:34:29] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2023-04-07 06:34:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2023-04-07 06:34:29] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2023-04-07 06:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-07 06:34:30] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-04-07 06:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-07 06:34:30] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-04-07 06:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 06:34:30] [INFO ] After 7058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1078 ms.
[2023-04-07 06:34:31] [INFO ] After 9343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 132 ms.
Support contains 44 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2936/2936 transitions.
Applied a total of 0 rules in 209 ms. Remains 491 /491 variables (removed 0) and now considering 2936/2936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 491/491 places, 2936/2936 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2936/2936 transitions.
Applied a total of 0 rules in 146 ms. Remains 491 /491 variables (removed 0) and now considering 2936/2936 (removed 0) transitions.
[2023-04-07 06:34:32] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
[2023-04-07 06:34:32] [INFO ] Invariant cache hit.
[2023-04-07 06:34:32] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-04-07 06:34:32] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
[2023-04-07 06:34:32] [INFO ] Invariant cache hit.
[2023-04-07 06:34:33] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-04-07 06:34:34] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2023-04-07 06:34:35] [INFO ] Redundant transitions in 161 ms returned []
[2023-04-07 06:34:35] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
[2023-04-07 06:34:35] [INFO ] Invariant cache hit.
[2023-04-07 06:34:35] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3956 ms. Remains : 491/491 places, 2936/2936 transitions.
Graph (trivial) has 2315 edges and 491 vertex of which 79 / 491 are part of one of the 9 SCC in 6 ms
Free SCC test removed 70 places
Drop transitions removed 267 transitions
Ensure Unique test removed 2040 transitions
Reduce isomorphic transitions removed 2307 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 421 transition count 548
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 340 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 339 transition count 547
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 165 place count 339 transition count 532
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 200 place count 319 transition count 532
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 454 place count 192 transition count 405
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 494 place count 192 transition count 365
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 500 place count 189 transition count 367
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 504 place count 189 transition count 363
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 534 place count 189 transition count 333
Free-agglomeration rule applied 90 times.
Iterating global reduction 5 with 90 rules applied. Total rules applied 624 place count 189 transition count 243
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 5 with 90 rules applied. Total rules applied 714 place count 99 transition count 243
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 724 place count 99 transition count 243
Applied a total of 724 rules in 60 ms. Remains 99 /491 variables (removed 392) and now considering 243/2936 (removed 2693) transitions.
Running SMT prover for 20 properties.
// Phase 1: matrix 243 rows 99 cols
[2023-04-07 06:34:36] [INFO ] Computed 23 invariants in 2 ms
[2023-04-07 06:34:36] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:34:36] [INFO ] [Real]Absence check using 19 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 06:34:36] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 06:34:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 06:34:36] [INFO ] [Nat]Absence check using 19 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 06:34:36] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-07 06:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-07 06:34:36] [INFO ] After 172ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-07 06:34:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-07 06:34:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-04-07 06:34:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-04-07 06:34:37] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-04-07 06:34:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 139 ms
[2023-04-07 06:34:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-04-07 06:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-04-07 06:34:37] [INFO ] After 592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-04-07 06:34:37] [INFO ] After 1060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
FORMULA EisenbergMcGuire-PT-09-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 73 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 06:34:37] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 06:34:37] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 06:34:38] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-04-07 06:34:38] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:34:38] [INFO ] Invariant cache hit.
[2023-04-07 06:34:39] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:34:43] [INFO ] Implicit Places using invariants and state equation in 5177 ms returned []
Implicit Place search using SMT with State Equation took 5999 ms to find 0 implicit places.
[2023-04-07 06:34:43] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:34:43] [INFO ] Invariant cache hit.
[2023-04-07 06:34:45] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7220 ms. Remains : 819/823 places, 3240/3276 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 191 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s91 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 297 steps with 0 reset in 6 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 7491 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(!p0) U ((X(!p0)&&(!p1||X(F(p2))))||X(G(!p0))))))'
Support contains 11 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 48 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2023-04-07 06:34:45] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-07 06:34:45] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 06:34:47] [INFO ] Implicit Places using invariants in 2062 ms returned []
[2023-04-07 06:34:47] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 06:34:47] [INFO ] Invariant cache hit.
[2023-04-07 06:34:47] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:34:52] [INFO ] Implicit Places using invariants and state equation in 4621 ms returned []
Implicit Place search using SMT with State Equation took 6693 ms to find 0 implicit places.
[2023-04-07 06:34:52] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 06:34:52] [INFO ] Invariant cache hit.
[2023-04-07 06:34:53] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7972 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 284 ms :[p0, p0, p0, (AND p0 (NOT p2)), true, (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s51 1)), p0:(OR (AND (EQ s4 1) (EQ s21 1) (EQ s606 1)) (AND (EQ s3 1) (EQ s20 1) (EQ s557 1))), p2:(AND (EQ s2 1) (EQ s16 1) (EQ s61...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 904 ms.
Product exploration explored 100000 steps with 33333 reset in 786 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 28 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-02 finished in 10042 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(p1)&&p0) U ((p2||X(X(X(!p1)))) U p1))))'
Support contains 7 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 821 transition count 3258
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 821 transition count 3258
Applied a total of 4 rules in 30 ms. Remains 821 /823 variables (removed 2) and now considering 3258/3276 (removed 18) transitions.
[2023-04-07 06:34:55] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
// Phase 1: matrix 1179 rows 821 cols
[2023-04-07 06:34:55] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 06:34:55] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-04-07 06:34:55] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 06:34:55] [INFO ] Invariant cache hit.
[2023-04-07 06:34:56] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-07 06:35:00] [INFO ] Implicit Places using invariants and state equation in 4229 ms returned []
Implicit Place search using SMT with State Equation took 4863 ms to find 0 implicit places.
[2023-04-07 06:35:00] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 06:35:00] [INFO ] Invariant cache hit.
[2023-04-07 06:35:01] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 821/823 places, 3258/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5996 ms. Remains : 821/823 places, 3258/3276 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), p1, (NOT p1), p1, p1, true]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s29 1) (EQ s590 1)), p0:(AND (EQ s7 1) (EQ s208 1)), p2:(AND (EQ s0 1) (EQ s207 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16613 reset in 564 ms.
Stack based approach found an accepted trace after 43124 steps with 7179 reset with depth 6 and stack size 6 in 259 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-03 finished in 7064 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((X(F(p0)) U (p1||F(p2)))))'
Support contains 8 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 212 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2023-04-07 06:35:02] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 06:35:02] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 06:35:03] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-04-07 06:35:03] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:03] [INFO ] Invariant cache hit.
[2023-04-07 06:35:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:35:05] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 2862 ms to find 0 implicit places.
[2023-04-07 06:35:05] [INFO ] Redundant transitions in 143 ms returned []
[2023-04-07 06:35:05] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:05] [INFO ] Invariant cache hit.
[2023-04-07 06:35:06] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4162 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s32 1) (EQ s216 1)), p2:(AND (EQ s7 1) (EQ s31 1) (EQ s313 1)), p0:(AND (EQ s6 1) (EQ s29 1) (EQ s307 1) (EQ s32 1) (EQ s216 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 4517 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 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 180 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2023-04-07 06:35:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 06:35:07] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 06:35:07] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-04-07 06:35:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:07] [INFO ] Invariant cache hit.
[2023-04-07 06:35:08] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:35:10] [INFO ] Implicit Places using invariants and state equation in 2775 ms returned []
Implicit Place search using SMT with State Equation took 3484 ms to find 0 implicit places.
[2023-04-07 06:35:10] [INFO ] Redundant transitions in 79 ms returned []
[2023-04-07 06:35:10] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:10] [INFO ] Invariant cache hit.
[2023-04-07 06:35:11] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4749 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s156 1)], 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 0 reset in 264 ms.
Product exploration explored 100000 steps with 0 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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 95 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 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 342 ms. (steps per millisecond=158 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 342 ms. (steps per millisecond=158 ) properties seen :1
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 87 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 98 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2023-04-07 06:35:13] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:13] [INFO ] Invariant cache hit.
[2023-04-07 06:35:13] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-04-07 06:35:13] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:13] [INFO ] Invariant cache hit.
[2023-04-07 06:35:13] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:35:16] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 3246 ms to find 0 implicit places.
[2023-04-07 06:35:16] [INFO ] Redundant transitions in 66 ms returned []
[2023-04-07 06:35:16] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:16] [INFO ] Invariant cache hit.
[2023-04-07 06:35:17] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4535 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
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 71 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 355 ms. (steps per millisecond=152 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 355 ms. (steps per millisecond=152 ) properties seen :1
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 131 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 89 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2023-04-07 06:35:18] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:18] [INFO ] Invariant cache hit.
[2023-04-07 06:35:19] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-04-07 06:35:19] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:19] [INFO ] Invariant cache hit.
[2023-04-07 06:35:19] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:35:21] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 3028 ms to find 0 implicit places.
[2023-04-07 06:35:21] [INFO ] Redundant transitions in 67 ms returned []
[2023-04-07 06:35:21] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 06:35:21] [INFO ] Invariant cache hit.
[2023-04-07 06:35:22] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4211 ms. Remains : 487/487 places, 2908/2908 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-05 finished in 16379 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((F((X(p1)||G(p2)))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 30 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2023-04-07 06:35:23] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-07 06:35:23] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 06:35:23] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-04-07 06:35:23] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 06:35:23] [INFO ] Invariant cache hit.
[2023-04-07 06:35:24] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:35:32] [INFO ] Implicit Places using invariants and state equation in 8166 ms returned []
Implicit Place search using SMT with State Equation took 8789 ms to find 0 implicit places.
[2023-04-07 06:35:32] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 06:35:32] [INFO ] Invariant cache hit.
[2023-04-07 06:35:34] [INFO ] Dead Transitions using invariants and state equation in 2570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11398 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s165 0)), p2:(OR (EQ s6 0) (EQ s207 0)), p1:(OR (EQ s32 0) (EQ s165 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50 reset in 253 ms.
Product exploration explored 100000 steps with 51 reset in 324 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:35:36] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 06:35:36] [INFO ] Invariant cache hit.
[2023-04-07 06:35:36] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:35:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 36 ms returned sat
[2023-04-07 06:35:36] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:35:37] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:35:37] [INFO ] After 204ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:38] [INFO ] Deduced a trap composed of 54 places in 422 ms of which 1 ms to minimize.
[2023-04-07 06:35:38] [INFO ] Deduced a trap composed of 3 places in 398 ms of which 1 ms to minimize.
[2023-04-07 06:35:39] [INFO ] Deduced a trap composed of 85 places in 421 ms of which 1 ms to minimize.
[2023-04-07 06:35:39] [INFO ] Deduced a trap composed of 67 places in 412 ms of which 0 ms to minimize.
[2023-04-07 06:35:40] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 1 ms to minimize.
[2023-04-07 06:35:40] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2023-04-07 06:35:40] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 0 ms to minimize.
[2023-04-07 06:35:41] [INFO ] Deduced a trap composed of 50 places in 382 ms of which 0 ms to minimize.
[2023-04-07 06:35:41] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 1 ms to minimize.
[2023-04-07 06:35:42] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 1 ms to minimize.
[2023-04-07 06:35:42] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 0 ms to minimize.
[2023-04-07 06:35:42] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2023-04-07 06:35:43] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 06:35:43] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-04-07 06:35:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5804 ms
[2023-04-07 06:35:43] [INFO ] After 6117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-04-07 06:35:43] [INFO ] After 7139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 1 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 471 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 488/820 places, 2917/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 349260 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349260 steps, saw 217247 distinct states, run finished after 3013 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:35:47] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 06:35:47] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 06:35:47] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:35:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-04-07 06:35:47] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 06:35:48] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:48] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:35:48] [INFO ] After 127ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:48] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-04-07 06:35:48] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 2 ms to minimize.
[2023-04-07 06:35:49] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2023-04-07 06:35:49] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 1 ms to minimize.
[2023-04-07 06:35:49] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 0 ms to minimize.
[2023-04-07 06:35:50] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 1 ms to minimize.
[2023-04-07 06:35:50] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 1 ms to minimize.
[2023-04-07 06:35:52] [INFO ] Deduced a trap composed of 35 places in 2567 ms of which 32 ms to minimize.
[2023-04-07 06:35:53] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 0 ms to minimize.
[2023-04-07 06:35:53] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 0 ms to minimize.
[2023-04-07 06:35:53] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 0 ms to minimize.
[2023-04-07 06:35:54] [INFO ] Deduced a trap composed of 19 places in 620 ms of which 1 ms to minimize.
[2023-04-07 06:35:54] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-07 06:35:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6520 ms
[2023-04-07 06:35:54] [INFO ] After 6727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-04-07 06:35:54] [INFO ] After 7443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 203 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 177 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:35:55] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:35:55] [INFO ] Invariant cache hit.
[2023-04-07 06:35:56] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-04-07 06:35:56] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:35:56] [INFO ] Invariant cache hit.
[2023-04-07 06:35:56] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:36:03] [INFO ] Implicit Places using invariants and state equation in 7167 ms returned []
Implicit Place search using SMT with State Equation took 7981 ms to find 0 implicit places.
[2023-04-07 06:36:03] [INFO ] Redundant transitions in 85 ms returned []
[2023-04-07 06:36:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:03] [INFO ] Invariant cache hit.
[2023-04-07 06:36:05] [INFO ] Dead Transitions using invariants and state equation in 2031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10314 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 84 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 06:36:05] [INFO ] Computed 21 invariants in 2 ms
[2023-04-07 06:36:05] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:36:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 06:36:05] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 06:36:06] [INFO ] After 620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 06:36:06] [INFO ] After 42ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:06] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 0 ms to minimize.
[2023-04-07 06:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 06:36:06] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 06:36:06] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 19 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 306 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2023-04-07 06:36:07] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 06:36:07] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 06:36:08] [INFO ] Implicit Places using invariants in 799 ms returned []
[2023-04-07 06:36:08] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:08] [INFO ] Invariant cache hit.
[2023-04-07 06:36:08] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:36:12] [INFO ] Implicit Places using invariants and state equation in 4257 ms returned []
Implicit Place search using SMT with State Equation took 5093 ms to find 0 implicit places.
[2023-04-07 06:36:12] [INFO ] Redundant transitions in 114 ms returned []
[2023-04-07 06:36:12] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:12] [INFO ] Invariant cache hit.
[2023-04-07 06:36:14] [INFO ] Dead Transitions using invariants and state equation in 1945 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/820 places, 2917/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7494 ms. Remains : 488/820 places, 2917/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:36:14] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:14] [INFO ] Invariant cache hit.
[2023-04-07 06:36:15] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:36:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-04-07 06:36:15] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 108 ms returned sat
[2023-04-07 06:36:15] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:36:15] [INFO ] After 138ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:16] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 0 ms to minimize.
[2023-04-07 06:36:16] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 1 ms to minimize.
[2023-04-07 06:36:16] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 1 ms to minimize.
[2023-04-07 06:36:17] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 0 ms to minimize.
[2023-04-07 06:36:17] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 1 ms to minimize.
[2023-04-07 06:36:17] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 0 ms to minimize.
[2023-04-07 06:36:18] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2023-04-07 06:36:18] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 0 ms to minimize.
[2023-04-07 06:36:18] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2023-04-07 06:36:18] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2023-04-07 06:36:18] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-07 06:36:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3065 ms
[2023-04-07 06:36:19] [INFO ] After 3250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-04-07 06:36:19] [INFO ] After 4006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 204 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 376560 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376560 steps, saw 232903 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:36:22] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:22] [INFO ] Invariant cache hit.
[2023-04-07 06:36:22] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:36:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:36:22] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:36:22] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:22] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:36:22] [INFO ] After 110ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:23] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 0 ms to minimize.
[2023-04-07 06:36:23] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 0 ms to minimize.
[2023-04-07 06:36:23] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-04-07 06:36:23] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 0 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 06:36:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1936 ms
[2023-04-07 06:36:24] [INFO ] After 2095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 06:36:25] [INFO ] After 2477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 97 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 95 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:36:25] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:25] [INFO ] Invariant cache hit.
[2023-04-07 06:36:25] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-04-07 06:36:25] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:25] [INFO ] Invariant cache hit.
[2023-04-07 06:36:25] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:36:28] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
[2023-04-07 06:36:28] [INFO ] Redundant transitions in 69 ms returned []
[2023-04-07 06:36:28] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:28] [INFO ] Invariant cache hit.
[2023-04-07 06:36:29] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4687 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 25 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 06:36:29] [INFO ] Computed 21 invariants in 2 ms
[2023-04-07 06:36:29] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:36:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 06:36:29] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 06:36:29] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 06:36:29] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:36:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-07 06:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-07 06:36:29] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 06:36:30] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 90 reset in 234 ms.
Product exploration explored 100000 steps with 89 reset in 239 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 86 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:36:30] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 06:36:30] [INFO ] Computed 28 invariants in 9 ms
[2023-04-07 06:36:31] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-04-07 06:36:31] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:31] [INFO ] Invariant cache hit.
[2023-04-07 06:36:31] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:36:33] [INFO ] Implicit Places using invariants and state equation in 2428 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2023-04-07 06:36:33] [INFO ] Redundant transitions in 69 ms returned []
[2023-04-07 06:36:33] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:36:33] [INFO ] Invariant cache hit.
[2023-04-07 06:36:35] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4204 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 71907 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||(!p1 U (p2||G(!p1)))))||(p0&&F(p3))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 150 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2023-04-07 06:36:35] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-07 06:36:35] [INFO ] Computed 28 invariants in 11 ms
[2023-04-07 06:36:35] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-04-07 06:36:35] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:35] [INFO ] Invariant cache hit.
[2023-04-07 06:36:36] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:36:38] [INFO ] Implicit Places using invariants and state equation in 2345 ms returned []
Implicit Place search using SMT with State Equation took 2799 ms to find 0 implicit places.
[2023-04-07 06:36:38] [INFO ] Redundant transitions in 75 ms returned []
[2023-04-07 06:36:38] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:38] [INFO ] Invariant cache hit.
[2023-04-07 06:36:39] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3915 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s290 1), p2:(AND (NOT (AND (EQ s6 1) (EQ s27 1) (EQ s300 1))) (NOT (AND (EQ s15 1) (EQ s217 1)))), p1:(AND (EQ s15 1) (EQ s217 1)), p3:(OR (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 136 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 177580 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177580 steps, saw 117540 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 10 properties.
[2023-04-07 06:36:43] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:43] [INFO ] Invariant cache hit.
[2023-04-07 06:36:44] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:36:44] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 15 ms returned sat
[2023-04-07 06:36:44] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-04-07 06:36:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:36:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:36:44] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2023-04-07 06:36:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:36:44] [INFO ] After 209ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2023-04-07 06:36:45] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-04-07 06:36:45] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2023-04-07 06:36:45] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2023-04-07 06:36:45] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-07 06:36:45] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2023-04-07 06:36:46] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-04-07 06:36:47] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2023-04-07 06:36:47] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-07 06:36:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2330 ms
[2023-04-07 06:36:47] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-07 06:36:47] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-07 06:36:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-04-07 06:36:47] [INFO ] After 2930ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-04-07 06:36:47] [INFO ] After 3619ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 83 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 250160 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250160 steps, saw 160536 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 06:36:51] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:51] [INFO ] Invariant cache hit.
[2023-04-07 06:36:51] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 06:36:51] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:36:51] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 06:36:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:36:51] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:36:51] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 06:36:51] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:36:51] [INFO ] After 221ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 06:36:52] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2023-04-07 06:36:52] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 06:36:52] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 0 ms to minimize.
[2023-04-07 06:36:52] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 1 ms to minimize.
[2023-04-07 06:36:52] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-04-07 06:36:52] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1542 ms
[2023-04-07 06:36:53] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2023-04-07 06:36:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2023-04-07 06:36:54] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-04-07 06:36:54] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2023-04-07 06:36:54] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2023-04-07 06:36:54] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 0 ms to minimize.
[2023-04-07 06:36:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 676 ms
[2023-04-07 06:36:54] [INFO ] After 2961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-04-07 06:36:54] [INFO ] After 3552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 89 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 87 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2023-04-07 06:36:54] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:55] [INFO ] Invariant cache hit.
[2023-04-07 06:36:55] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-04-07 06:36:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:55] [INFO ] Invariant cache hit.
[2023-04-07 06:36:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:36:57] [INFO ] Implicit Places using invariants and state equation in 2320 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2023-04-07 06:36:57] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 06:36:57] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:36:57] [INFO ] Invariant cache hit.
[2023-04-07 06:36:58] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3740 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2647 edges and 488 vertex of which 81 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 416 transition count 520
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 322 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 321 transition count 519
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 191 place count 321 transition count 500
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 238 place count 293 transition count 500
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 518 place count 153 transition count 360
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 583 place count 153 transition count 295
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 4 with 12 rules applied. Total rules applied 595 place count 147 transition count 295
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 601 place count 147 transition count 289
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 610 place count 147 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 685 place count 147 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 760 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 769 place count 72 transition count 205
Applied a total of 769 rules in 29 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 205 rows 72 cols
[2023-04-07 06:36:58] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 06:36:58] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-04-07 06:36:58] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 06:36:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 06:36:58] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 06:36:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 06:36:58] [INFO ] After 45ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 06:36:59] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-07 06:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-07 06:36:59] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-07 06:36:59] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p3) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (G (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 28 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-08 finished in 24048 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 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 158 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2023-04-07 06:36:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:36:59] [INFO ] Computed 28 invariants in 18 ms
[2023-04-07 06:36:59] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-04-07 06:36:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:36:59] [INFO ] Invariant cache hit.
[2023-04-07 06:37:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:02] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
[2023-04-07 06:37:02] [INFO ] Redundant transitions in 93 ms returned []
[2023-04-07 06:37:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:02] [INFO ] Invariant cache hit.
[2023-04-07 06:37:03] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3935 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s7 0) (EQ s30 0) (EQ s304 0)) (OR (NEQ s1 1) (NEQ s12 1) (NEQ s340 1)))], 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 0 reset in 285 ms.
Product exploration explored 100000 steps with 0 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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 127 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 56 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 470490 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470490 steps, saw 287087 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:37:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:07] [INFO ] Invariant cache hit.
[2023-04-07 06:37:07] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:37:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:37:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:37:07] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:07] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:07] [INFO ] After 98ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:07] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-07 06:37:08] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 1 ms to minimize.
[2023-04-07 06:37:08] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2023-04-07 06:37:08] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 06:37:08] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2023-04-07 06:37:08] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 15 ms to minimize.
[2023-04-07 06:37:10] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-04-07 06:37:10] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2023-04-07 06:37:10] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 06:37:10] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-04-07 06:37:10] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2700 ms
[2023-04-07 06:37:10] [INFO ] After 2845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-07 06:37:10] [INFO ] After 3229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 89 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 473720 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473720 steps, saw 288947 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:37:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:13] [INFO ] Invariant cache hit.
[2023-04-07 06:37:13] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:37:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 06:37:13] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:37:13] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:13] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:14] [INFO ] After 93ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:14] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-07 06:37:14] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 0 ms to minimize.
[2023-04-07 06:37:14] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-07 06:37:14] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-04-07 06:37:15] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2023-04-07 06:37:15] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-04-07 06:37:15] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2023-04-07 06:37:15] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-04-07 06:37:15] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-04-07 06:37:15] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2671 ms
[2023-04-07 06:37:16] [INFO ] After 2810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-07 06:37:16] [INFO ] After 3149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:37:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:17] [INFO ] Invariant cache hit.
[2023-04-07 06:37:17] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-04-07 06:37:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:17] [INFO ] Invariant cache hit.
[2023-04-07 06:37:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:19] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
[2023-04-07 06:37:19] [INFO ] Redundant transitions in 66 ms returned []
[2023-04-07 06:37:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:19] [INFO ] Invariant cache hit.
[2023-04-07 06:37:21] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4529 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 57 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2023-04-07 06:37:21] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 06:37:21] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:37:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 06:37:21] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-07 06:37:21] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
[2023-04-07 06:37:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 4 ms to minimize.
[2023-04-07 06:37:21] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 06:37:21] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 06:37:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 113 ms
[2023-04-07 06:37:21] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 06:37:21] [INFO ] After 236ms 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 66 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:37:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:37:22] [INFO ] Computed 28 invariants in 8 ms
[2023-04-07 06:37:22] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-04-07 06:37:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:22] [INFO ] Invariant cache hit.
[2023-04-07 06:37:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:24] [INFO ] Implicit Places using invariants and state equation in 2340 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2023-04-07 06:37:24] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 06:37:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:24] [INFO ] Invariant cache hit.
[2023-04-07 06:37:25] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3833 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
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 128 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 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 480700 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 480700 steps, saw 292632 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:37:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:29] [INFO ] Invariant cache hit.
[2023-04-07 06:37:29] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:37:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:37:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:37:29] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:29] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:29] [INFO ] After 93ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:29] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-04-07 06:37:29] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-07 06:37:30] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 0 ms to minimize.
[2023-04-07 06:37:30] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 06:37:30] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2023-04-07 06:37:30] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2023-04-07 06:37:30] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 0 ms to minimize.
[2023-04-07 06:37:31] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2023-04-07 06:37:31] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2023-04-07 06:37:31] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2023-04-07 06:37:31] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-04-07 06:37:31] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-04-07 06:37:31] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2023-04-07 06:37:32] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-04-07 06:37:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-04-07 06:37:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 06:37:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-04-07 06:37:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2811 ms
[2023-04-07 06:37:32] [INFO ] After 2953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 06:37:32] [INFO ] After 3295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 90 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481320 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481320 steps, saw 293070 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:37:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:35] [INFO ] Invariant cache hit.
[2023-04-07 06:37:35] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:37:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 06:37:35] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:37:35] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:35] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:35] [INFO ] After 94ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:36] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-04-07 06:37:36] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 1 ms to minimize.
[2023-04-07 06:37:36] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 0 ms to minimize.
[2023-04-07 06:37:36] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2023-04-07 06:37:36] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-04-07 06:37:37] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2023-04-07 06:37:37] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2023-04-07 06:37:37] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-07 06:37:37] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-04-07 06:37:37] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2023-04-07 06:37:37] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-04-07 06:37:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2617 ms
[2023-04-07 06:37:38] [INFO ] After 2758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 06:37:38] [INFO ] After 3111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:37:38] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:38] [INFO ] Invariant cache hit.
[2023-04-07 06:37:39] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-04-07 06:37:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:39] [INFO ] Invariant cache hit.
[2023-04-07 06:37:39] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:41] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2023-04-07 06:37:41] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 06:37:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:41] [INFO ] Invariant cache hit.
[2023-04-07 06:37:42] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3826 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 22 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2023-04-07 06:37:42] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 06:37:42] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:37:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 06:37:42] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-07 06:37:42] [INFO ] After 19ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 06:37:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 102 ms
[2023-04-07 06:37:42] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 06:37:42] [INFO ] After 224ms 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 66 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 291 ms.
Product exploration explored 100000 steps with 0 reset in 330 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 88 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:37:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:37:43] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 06:37:44] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-04-07 06:37:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:44] [INFO ] Invariant cache hit.
[2023-04-07 06:37:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:46] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
[2023-04-07 06:37:46] [INFO ] Redundant transitions in 69 ms returned []
[2023-04-07 06:37:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:37:46] [INFO ] Invariant cache hit.
[2023-04-07 06:37:47] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3787 ms. Remains : 486/486 places, 2907/2907 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-09 finished in 48380 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&&F(G(p1))))))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 35 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 06:37:47] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 06:37:47] [INFO ] Computed 28 invariants in 8 ms
[2023-04-07 06:37:48] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-04-07 06:37:48] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:37:48] [INFO ] Invariant cache hit.
[2023-04-07 06:37:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:52] [INFO ] Implicit Places using invariants and state equation in 4548 ms returned []
Implicit Place search using SMT with State Equation took 5039 ms to find 0 implicit places.
[2023-04-07 06:37:52] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:37:52] [INFO ] Invariant cache hit.
[2023-04-07 06:37:53] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6123 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s29 0) (EQ s581 0)), p1:(AND (EQ s2 1) (EQ s17 1) (EQ s553 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 6589 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(((p0||(!p1&&G(!p2))) U p3)))'
Support contains 8 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 823 transition count 3268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 815 transition count 3268
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 16 place count 815 transition count 3017
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 158 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2023-04-07 06:37:54] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-07 06:37:54] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 06:37:54] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-04-07 06:37:54] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:37:54] [INFO ] Invariant cache hit.
[2023-04-07 06:37:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:37:56] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned []
Implicit Place search using SMT with State Equation took 2633 ms to find 0 implicit places.
[2023-04-07 06:37:57] [INFO ] Redundant transitions in 73 ms returned []
[2023-04-07 06:37:57] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:37:57] [INFO ] Invariant cache hit.
[2023-04-07 06:37:57] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3744 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p3), true, p2, (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p3 p0 (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s13 1) (EQ s135 1)), p0:(AND (EQ s0 1) (EQ s9 1) (EQ s362 1)), p1:(AND (EQ s13 1) (EQ s135 1) (EQ s5 1) (EQ s26 1) (EQ s364 1)), p2:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 282 ms.
Product exploration explored 100000 steps with 0 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (OR p3 p0 (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (OR p3 p0 (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p3), true, p2, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 06:37:59] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:37:59] [INFO ] Invariant cache hit.
[2023-04-07 06:37:59] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:37:59] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:37:59] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 06:37:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:37:59] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:37:59] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 06:37:59] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:38:00] [INFO ] After 201ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 06:38:00] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 1 ms to minimize.
[2023-04-07 06:38:00] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2023-04-07 06:38:00] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 1 ms to minimize.
[2023-04-07 06:38:00] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2023-04-07 06:38:01] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 1 ms to minimize.
[2023-04-07 06:38:01] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 0 ms to minimize.
[2023-04-07 06:38:01] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2023-04-07 06:38:01] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2023-04-07 06:38:02] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
[2023-04-07 06:38:02] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 0 ms to minimize.
[2023-04-07 06:38:02] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2023-04-07 06:38:02] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2023-04-07 06:38:02] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 1 ms to minimize.
[2023-04-07 06:38:03] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 0 ms to minimize.
[2023-04-07 06:38:03] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 0 ms to minimize.
[2023-04-07 06:38:03] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 0 ms to minimize.
[2023-04-07 06:38:04] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2023-04-07 06:38:04] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 0 ms to minimize.
[2023-04-07 06:38:04] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2023-04-07 06:38:04] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2023-04-07 06:38:04] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4563 ms
[2023-04-07 06:38:04] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:38:04] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:38:05] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-04-07 06:38:05] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2023-04-07 06:38:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 573 ms
[2023-04-07 06:38:05] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-04-07 06:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-07 06:38:05] [INFO ] After 5647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-04-07 06:38:05] [INFO ] After 6243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 86 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 196980 steps, run timeout after 3005 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196980 steps, saw 128571 distinct states, run finished after 3005 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 06:38:09] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:38:09] [INFO ] Invariant cache hit.
[2023-04-07 06:38:09] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:38:09] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:38:09] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 06:38:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:38:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 06:38:09] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 06:38:09] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:38:09] [INFO ] After 198ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 06:38:10] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-07 06:38:10] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2023-04-07 06:38:10] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 0 ms to minimize.
[2023-04-07 06:38:10] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 1 ms to minimize.
[2023-04-07 06:38:10] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 0 ms to minimize.
[2023-04-07 06:38:11] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
[2023-04-07 06:38:11] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 0 ms to minimize.
[2023-04-07 06:38:11] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2023-04-07 06:38:11] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 0 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2023-04-07 06:38:13] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 0 ms to minimize.
[2023-04-07 06:38:13] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 0 ms to minimize.
[2023-04-07 06:38:13] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 1 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4552 ms
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 547 ms
[2023-04-07 06:38:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-04-07 06:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-07 06:38:15] [INFO ] After 5603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-04-07 06:38:15] [INFO ] After 6216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 88 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 86 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2023-04-07 06:38:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:38:15] [INFO ] Invariant cache hit.
[2023-04-07 06:38:15] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-04-07 06:38:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:38:15] [INFO ] Invariant cache hit.
[2023-04-07 06:38:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:38:18] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2023-04-07 06:38:18] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 06:38:18] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 06:38:18] [INFO ] Invariant cache hit.
[2023-04-07 06:38:19] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3769 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2674 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 417 transition count 520
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 320 transition count 520
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 320 transition count 502
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 294 transition count 502
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 523 place count 152 transition count 360
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 592 place count 152 transition count 291
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 606 place count 145 transition count 292
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 613 place count 145 transition count 285
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 620 place count 145 transition count 278
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 693 place count 145 transition count 205
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 766 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 775 place count 72 transition count 205
Applied a total of 775 rules in 24 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 205 rows 72 cols
[2023-04-07 06:38:19] [INFO ] Computed 20 invariants in 14 ms
[2023-04-07 06:38:19] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-04-07 06:38:19] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 06:38:19] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 06:38:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 06:38:19] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 06:38:19] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 06:38:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 06:38:19] [INFO ] After 37ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 06:38:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 06:38:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 06:38:19] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 06:38:19] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (OR p3 p0 (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (OR p3 p0 (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
Knowledge based reduction with 12 factoid took 216 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p3), true, p2, (NOT p3)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p3), true, p2, (NOT p3)]
[2023-04-07 06:38:20] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-07 06:38:20] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 06:38:21] [INFO ] [Real]Absence check using 19 positive place invariants in 51 ms returned sat
[2023-04-07 06:38:21] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 36 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (OR p3 p0 (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (OR p3 p0 (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 12 factoid took 226 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 27278 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||X(p1))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 34 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 06:38:21] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 06:38:21] [INFO ] Computed 28 invariants in 7 ms
[2023-04-07 06:38:22] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-04-07 06:38:22] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:38:22] [INFO ] Invariant cache hit.
[2023-04-07 06:38:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:38:27] [INFO ] Implicit Places using invariants and state equation in 5055 ms returned []
Implicit Place search using SMT with State Equation took 5582 ms to find 0 implicit places.
[2023-04-07 06:38:27] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:38:27] [INFO ] Invariant cache hit.
[2023-04-07 06:38:28] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6741 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s33 1) (EQ s710 1)), p1:(AND (EQ s2 1) (EQ s16 1) (EQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-12 finished in 6882 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||X((F(p2)&&p1)))))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 34 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 06:38:28] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:38:28] [INFO ] Invariant cache hit.
[2023-04-07 06:38:28] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-04-07 06:38:28] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:38:28] [INFO ] Invariant cache hit.
[2023-04-07 06:38:29] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:38:33] [INFO ] Implicit Places using invariants and state equation in 4484 ms returned []
Implicit Place search using SMT with State Equation took 4992 ms to find 0 implicit places.
[2023-04-07 06:38:33] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 06:38:33] [INFO ] Invariant cache hit.
[2023-04-07 06:38:34] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6071 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s10 1) (EQ s599 1)), p1:(AND (EQ s3 1) (EQ s20 1) (EQ s592 1)), p2:(AND (EQ s3 1) (EQ s20 1) (EQ s592 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 251 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 6481 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)))'
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((F((X(p1)||G(p2)))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-07
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 523 place count 560 transition count 2989
Iterating global reduction 2 with 3 rules applied. Total rules applied 526 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2917
Applied a total of 670 rules in 91 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2023-04-07 06:38:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 06:38:35] [INFO ] Computed 28 invariants in 6 ms
[2023-04-07 06:38:35] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-04-07 06:38:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:35] [INFO ] Invariant cache hit.
[2023-04-07 06:38:36] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:38:37] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2646 ms to find 0 implicit places.
[2023-04-07 06:38:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:37] [INFO ] Invariant cache hit.
[2023-04-07 06:38:39] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2917/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4451 ms. Remains : 488/823 places, 2917/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s135 0)), p2:(OR (EQ s6 0) (EQ s136 0)), p1:(OR (EQ s32 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 89 reset in 238 ms.
Product exploration explored 100000 steps with 90 reset in 248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:38:40] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:40] [INFO ] Invariant cache hit.
[2023-04-07 06:38:40] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:38:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:38:40] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:38:40] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:40] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:38:40] [INFO ] After 115ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:41] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2023-04-07 06:38:41] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-04-07 06:38:41] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2023-04-07 06:38:41] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2023-04-07 06:38:41] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 13 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-04-07 06:38:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1998 ms
[2023-04-07 06:38:42] [INFO ] After 2157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 06:38:42] [INFO ] After 2521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 84 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 456180 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 456180 steps, saw 277860 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:38:46] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:46] [INFO ] Invariant cache hit.
[2023-04-07 06:38:46] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:38:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:38:46] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:38:46] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:46] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:38:46] [INFO ] After 123ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:46] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-07 06:38:46] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-04-07 06:38:47] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 06:38:47] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 0 ms to minimize.
[2023-04-07 06:38:47] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2023-04-07 06:38:47] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-07 06:38:47] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2023-04-07 06:38:47] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2023-04-07 06:38:48] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-04-07 06:38:48] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-04-07 06:38:48] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-04-07 06:38:48] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-04-07 06:38:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1761 ms
[2023-04-07 06:38:48] [INFO ] After 1935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-04-07 06:38:48] [INFO ] After 2298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 84 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 98 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:38:48] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:48] [INFO ] Invariant cache hit.
[2023-04-07 06:38:49] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-04-07 06:38:49] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:49] [INFO ] Invariant cache hit.
[2023-04-07 06:38:49] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:38:51] [INFO ] Implicit Places using invariants and state equation in 2238 ms returned []
Implicit Place search using SMT with State Equation took 2709 ms to find 0 implicit places.
[2023-04-07 06:38:51] [INFO ] Redundant transitions in 68 ms returned []
[2023-04-07 06:38:51] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:51] [INFO ] Invariant cache hit.
[2023-04-07 06:38:52] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3717 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 24 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 06:38:52] [INFO ] Computed 21 invariants in 1 ms
[2023-04-07 06:38:52] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:38:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 06:38:52] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 06:38:52] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 06:38:52] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:52] [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 9 ms.
[2023-04-07 06:38:52] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 94 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:38:52] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 06:38:52] [INFO ] Computed 28 invariants in 6 ms
[2023-04-07 06:38:53] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-04-07 06:38:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:53] [INFO ] Invariant cache hit.
[2023-04-07 06:38:53] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:38:55] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2023-04-07 06:38:55] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 06:38:55] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:55] [INFO ] Invariant cache hit.
[2023-04-07 06:38:56] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3722 ms. Remains : 488/488 places, 2917/2917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:38:56] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:38:56] [INFO ] Invariant cache hit.
[2023-04-07 06:38:56] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:38:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:38:56] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:38:57] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:57] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:38:57] [INFO ] After 119ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:57] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 06:38:57] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2023-04-07 06:38:57] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 06:38:57] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 0 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-04-07 06:38:58] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-04-07 06:38:59] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-04-07 06:38:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1916 ms
[2023-04-07 06:38:59] [INFO ] After 2076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 06:38:59] [INFO ] After 2416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 82 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 475240 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 475240 steps, saw 287194 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:39:02] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:39:02] [INFO ] Invariant cache hit.
[2023-04-07 06:39:02] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:39:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:39:02] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:39:02] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:39:02] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:39:02] [INFO ] After 122ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:39:02] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-07 06:39:03] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2023-04-07 06:39:03] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-04-07 06:39:03] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2023-04-07 06:39:03] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2023-04-07 06:39:03] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 0 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-04-07 06:39:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1935 ms
[2023-04-07 06:39:04] [INFO ] After 2098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 06:39:04] [INFO ] After 2438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 85 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:39:04] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:39:04] [INFO ] Invariant cache hit.
[2023-04-07 06:39:05] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-04-07 06:39:05] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:39:05] [INFO ] Invariant cache hit.
[2023-04-07 06:39:05] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:39:07] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
[2023-04-07 06:39:07] [INFO ] Redundant transitions in 69 ms returned []
[2023-04-07 06:39:07] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:39:07] [INFO ] Invariant cache hit.
[2023-04-07 06:39:08] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3697 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 27 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 06:39:08] [INFO ] Computed 21 invariants in 0 ms
[2023-04-07 06:39:08] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:39:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 06:39:08] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 06:39:08] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:39:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 06:39:08] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:39:08] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 06:39:08] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 92 reset in 240 ms.
Product exploration explored 100000 steps with 89 reset in 250 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 85 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 06:39:09] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 06:39:09] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 06:39:10] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-04-07 06:39:10] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:39:10] [INFO ] Invariant cache hit.
[2023-04-07 06:39:10] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:39:12] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 2675 ms to find 0 implicit places.
[2023-04-07 06:39:12] [INFO ] Redundant transitions in 68 ms returned []
[2023-04-07 06:39:12] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 06:39:12] [INFO ] Invariant cache hit.
[2023-04-07 06:39:13] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3751 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 38583 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)))'
[2023-04-07 06:39:13] [INFO ] Flatten gal took : 207 ms
[2023-04-07 06:39:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 06:39:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 823 places, 3276 transitions and 16344 arcs took 38 ms.
Total runtime 339451 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2855/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2855/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2855/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-09-LTLFireability-05
Could not compute solution for formula : EisenbergMcGuire-PT-09-LTLFireability-07
Could not compute solution for formula : EisenbergMcGuire-PT-09-LTLFireability-09

BK_STOP 1680849558159

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name EisenbergMcGuire-PT-09-LTLFireability-05
ltl formula formula --ltl=/tmp/2855/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 823 places, 3276 transitions and 16344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2855/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.450 real 0.070 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2855/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2855/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2855/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5637a78bc3f4]
1: pnml2lts-mc(+0xa2496) [0x5637a78bc496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f487f57a140]
3: pnml2lts-mc(+0x405be5) [0x5637a7c1fbe5]
4: pnml2lts-mc(+0x16b3f9) [0x5637a79853f9]
5: pnml2lts-mc(+0x164ac4) [0x5637a797eac4]
6: pnml2lts-mc(+0x272e0a) [0x5637a7a8ce0a]
7: pnml2lts-mc(+0xb61f0) [0x5637a78d01f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f487f3cd4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f487f3cd67a]
10: pnml2lts-mc(+0xa1581) [0x5637a78bb581]
11: pnml2lts-mc(+0xa1910) [0x5637a78bb910]
12: pnml2lts-mc(+0xa32a2) [0x5637a78bd2a2]
13: pnml2lts-mc(+0xa50f4) [0x5637a78bf0f4]
14: pnml2lts-mc(+0x3f34b3) [0x5637a7c0d4b3]
15: pnml2lts-mc(+0x7c63d) [0x5637a789663d]
16: pnml2lts-mc(+0x67d86) [0x5637a7881d86]
17: pnml2lts-mc(+0x60a8a) [0x5637a787aa8a]
18: pnml2lts-mc(+0x5eb15) [0x5637a7878b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f487f3b5d0a]
20: pnml2lts-mc(+0x6075e) [0x5637a787a75e]
ltl formula name EisenbergMcGuire-PT-09-LTLFireability-07
ltl formula formula --ltl=/tmp/2855/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 823 places, 3276 transitions and 16344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.090 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2855/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2855/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2855/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2855/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name EisenbergMcGuire-PT-09-LTLFireability-09
ltl formula formula --ltl=/tmp/2855/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 823 places, 3276 transitions and 16344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2855/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.080 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2855/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2855/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2855/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;