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

--------------------
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 1680823201568

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 23:20:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 23:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:20:03] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-04-06 23:20:03] [INFO ] Transformed 891 places.
[2023-04-06 23:20:03] [INFO ] Transformed 3888 transitions.
[2023-04-06 23:20:03] [INFO ] Found NUPN structural information;
[2023-04-06 23:20:03] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 288 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 161 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2023-04-06 23:20:03] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2023-04-06 23:20:03] [INFO ] Computed 28 invariants in 35 ms
[2023-04-06 23:20:04] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-04-06 23:20:04] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-06 23:20:04] [INFO ] Invariant cache hit.
[2023-04-06 23:20:04] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-06 23:20:07] [INFO ] Implicit Places using invariants and state equation in 2989 ms returned []
Implicit Place search using SMT with State Equation took 3571 ms to find 0 implicit places.
[2023-04-06 23:20:07] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-06 23:20:07] [INFO ] Invariant cache hit.
[2023-04-06 23:20:08] [INFO ] Dead Transitions using invariants and state equation in 1099 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 4834 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 63 out of 823 places after structural reductions.
[2023-04-06 23:20:08] [INFO ] Flatten gal took : 213 ms
[2023-04-06 23:20:09] [INFO ] Flatten gal took : 146 ms
[2023-04-06 23:20:09] [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 511 ms. (steps per millisecond=19 ) properties (out of 33) seen :5
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 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 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 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 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 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 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 13 ms. (steps per millisecond=77 ) 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 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 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 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 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 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 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 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 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 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 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 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 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-04-06 23:20:10] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-06 23:20:10] [INFO ] Invariant cache hit.
[2023-04-06 23:20:10] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-04-06 23:20:10] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-06 23:20:10] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-06 23:20:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2023-04-06 23:20:11] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-06 23:20:13] [INFO ] After 1779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-06 23:20:13] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-06 23:20:15] [INFO ] After 2180ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-06 23:20:15] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 6 ms to minimize.
[2023-04-06 23:20:16] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2023-04-06 23:20:16] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-04-06 23:20:16] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:20:17] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:20:18] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 23:20:18] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 23:20:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2580 ms
[2023-04-06 23:20:18] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 1 ms to minimize.
[2023-04-06 23:20:18] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 0 ms to minimize.
[2023-04-06 23:20:18] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2023-04-06 23:20:19] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-04-06 23:20:19] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:20:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 964 ms
[2023-04-06 23:20:19] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 1 ms to minimize.
[2023-04-06 23:20:19] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-06 23:20:19] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2023-04-06 23:20:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2023-04-06 23:20:20] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2023-04-06 23:20:20] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2023-04-06 23:20:20] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2023-04-06 23:20:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 450 ms
[2023-04-06 23:20:20] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2023-04-06 23:20:20] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2023-04-06 23:20:20] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2023-04-06 23:20:21] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2023-04-06 23:20:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 705 ms
[2023-04-06 23:20:21] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:20:21] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2023-04-06 23:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-04-06 23:20:21] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2023-04-06 23:20:22] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:20:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2023-04-06 23:20:22] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-04-06 23:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-04-06 23:20:22] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-06 23:20:23] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 3 ms to minimize.
[2023-04-06 23:20:23] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2023-04-06 23:20:23] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2023-04-06 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2023-04-06 23:20:23] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-04-06 23:20:24] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2023-04-06 23:20:24] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-04-06 23:20:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2023-04-06 23:20:24] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2023-04-06 23:20:24] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2023-04-06 23:20:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-04-06 23:20:26] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2023-04-06 23:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-04-06 23:20:26] [INFO ] After 13030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 2941 ms.
[2023-04-06 23:20:29] [INFO ] After 18620ms 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 596 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 2 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 8 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 295 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 296 ms. Remains : 496/823 places, 2949/3276 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 116850 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{1=1, 8=1, 9=1, 11=1, 12=1, 17=1, 20=1, 25=1}
Probabilistic random walk after 116850 steps, saw 80767 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :8
Running SMT prover for 20 properties.
[2023-04-06 23:20:33] [INFO ] Flow matrix only has 870 transitions (discarded 2079 similar events)
// Phase 1: matrix 870 rows 496 cols
[2023-04-06 23:20:33] [INFO ] Computed 28 invariants in 5 ms
[2023-04-06 23:20:33] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 23:20:33] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:20:34] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 23:20:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 23:20:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:20:35] [INFO ] After 813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 23:20:35] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-06 23:20:36] [INFO ] After 903ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 23:20:36] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2023-04-06 23:20:36] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-06 23:20:36] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 0 ms to minimize.
[2023-04-06 23:20:36] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 0 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2023-04-06 23:20:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1793 ms
[2023-04-06 23:20:38] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 4 ms to minimize.
[2023-04-06 23:20:38] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:20:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-04-06 23:20:38] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-04-06 23:20:38] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2023-04-06 23:20:38] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2023-04-06 23:20:39] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-04-06 23:20:39] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:20:39] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:20:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 905 ms
[2023-04-06 23:20:39] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2023-04-06 23:20:39] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-04-06 23:20:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-06 23:20:39] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2023-04-06 23:20:40] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2023-04-06 23:20:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2023-04-06 23:20:40] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 4 ms to minimize.
[2023-04-06 23:20:40] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-04-06 23:20:40] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:20:40] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2023-04-06 23:20:40] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:20:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 707 ms
[2023-04-06 23:20:41] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:20:41] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-04-06 23:20:41] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-04-06 23:20:41] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:20:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 476 ms
[2023-04-06 23:20:41] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-04-06 23:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 23:20:41] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:20:42] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-04-06 23:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-06 23:20:42] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2023-04-06 23:20:42] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-04-06 23:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-04-06 23:20:42] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2023-04-06 23:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 23:20:42] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:20:43] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:20:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-04-06 23:20:43] [INFO ] After 7867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1084 ms.
[2023-04-06 23:20:44] [INFO ] After 10153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 184 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 133 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 133 ms. Remains : 491/496 places, 2936/2949 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) 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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Interrupted probabilistic random walk after 114770 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114770 steps, saw 78461 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-06 23:20:47] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
// Phase 1: matrix 857 rows 491 cols
[2023-04-06 23:20:47] [INFO ] Computed 28 invariants in 4 ms
[2023-04-06 23:20:48] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 23:20:48] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:20:48] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:20:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 23:20:48] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:20:49] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:20:49] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-04-06 23:20:50] [INFO ] After 852ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:20:50] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 0 ms to minimize.
[2023-04-06 23:20:50] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-06 23:20:50] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2023-04-06 23:20:51] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2023-04-06 23:20:51] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-06 23:20:51] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2023-04-06 23:20:51] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 1 ms to minimize.
[2023-04-06 23:20:51] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 1 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-04-06 23:20:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2641 ms
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:20:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-04-06 23:20:54] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-04-06 23:20:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 23:20:54] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2023-04-06 23:20:54] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:20:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-04-06 23:20:54] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:20:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:20:54] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:20:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 378 ms
[2023-04-06 23:20:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-06 23:20:55] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2023-04-06 23:20:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:20:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-04-06 23:20:55] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-04-06 23:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-04-06 23:20:56] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-04-06 23:20:56] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:20:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-04-06 23:20:56] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-06 23:20:56] [INFO ] After 7319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1133 ms.
[2023-04-06 23:20:57] [INFO ] After 9633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 170 ms.
Support contains 43 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2936/2936 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 490 transition count 2927
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 490 transition count 2927
Applied a total of 2 rules in 151 ms. Remains 490 /491 variables (removed 1) and now considering 2927/2936 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 490/491 places, 2927/2936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Interrupted probabilistic random walk after 145290 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145290 steps, saw 98271 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-06 23:21:01] [INFO ] Flow matrix only has 848 transitions (discarded 2079 similar events)
// Phase 1: matrix 848 rows 490 cols
[2023-04-06 23:21:01] [INFO ] Computed 28 invariants in 7 ms
[2023-04-06 23:21:01] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 23:21:01] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:21:01] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:21:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 23:21:02] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:21:03] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:21:03] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-06 23:21:03] [INFO ] After 907ms SMT Verify possible using 372 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:21:04] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 1 ms to minimize.
[2023-04-06 23:21:04] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-04-06 23:21:04] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-06 23:21:04] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2023-04-06 23:21:04] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-04-06 23:21:04] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1397 ms
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:21:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-04-06 23:21:05] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2023-04-06 23:21:06] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 0 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1130 ms
[2023-04-06 23:21:07] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-04-06 23:21:07] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 23:21:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-04-06 23:21:08] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2023-04-06 23:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-06 23:21:08] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2023-04-06 23:21:08] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2023-04-06 23:21:08] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-04-06 23:21:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 445 ms
[2023-04-06 23:21:08] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:21:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:21:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-04-06 23:21:09] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 23:21:09] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 23:21:09] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:21:09] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-04-06 23:21:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2023-04-06 23:21:10] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:21:10] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:21:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-06 23:21:10] [INFO ] After 7213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 978 ms.
[2023-04-06 23:21:11] [INFO ] After 9409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 176 ms.
Support contains 43 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 2927/2927 transitions.
Applied a total of 0 rules in 99 ms. Remains 490 /490 variables (removed 0) and now considering 2927/2927 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 490/490 places, 2927/2927 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 2927/2927 transitions.
Applied a total of 0 rules in 98 ms. Remains 490 /490 variables (removed 0) and now considering 2927/2927 (removed 0) transitions.
[2023-04-06 23:21:11] [INFO ] Flow matrix only has 848 transitions (discarded 2079 similar events)
[2023-04-06 23:21:11] [INFO ] Invariant cache hit.
[2023-04-06 23:21:11] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-04-06 23:21:11] [INFO ] Flow matrix only has 848 transitions (discarded 2079 similar events)
[2023-04-06 23:21:11] [INFO ] Invariant cache hit.
[2023-04-06 23:21:12] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-06 23:21:13] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 2360 ms to find 0 implicit places.
[2023-04-06 23:21:14] [INFO ] Redundant transitions in 165 ms returned []
[2023-04-06 23:21:14] [INFO ] Flow matrix only has 848 transitions (discarded 2079 similar events)
[2023-04-06 23:21:14] [INFO ] Invariant cache hit.
[2023-04-06 23:21:15] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3535 ms. Remains : 490/490 places, 2927/2927 transitions.
Graph (trivial) has 2317 edges and 490 vertex of which 80 / 490 are part of one of the 9 SCC in 7 ms
Free SCC test removed 71 places
Drop transitions removed 271 transitions
Ensure Unique test removed 2033 transitions
Reduce isomorphic transitions removed 2304 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 419 transition count 542
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 338 transition count 541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 337 transition count 541
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 165 place count 337 transition count 525
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 203 place count 315 transition count 525
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 457 place count 188 transition count 398
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 497 place count 188 transition count 358
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 501 place count 186 transition count 359
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 503 place count 186 transition count 357
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 530 place count 186 transition count 330
Free-agglomeration rule applied 90 times.
Iterating global reduction 5 with 90 rules applied. Total rules applied 620 place count 186 transition count 240
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 5 with 90 rules applied. Total rules applied 710 place count 96 transition count 240
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 720 place count 96 transition count 240
Applied a total of 720 rules in 74 ms. Remains 96 /490 variables (removed 394) and now considering 240/2927 (removed 2687) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 240 rows 96 cols
[2023-04-06 23:21:15] [INFO ] Computed 22 invariants in 1 ms
[2023-04-06 23:21:15] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:21:15] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-06 23:21:15] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:21:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 23:21:15] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-06 23:21:15] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 23:21:15] [INFO ] After 175ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:21:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2023-04-06 23:21:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-06 23:21:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-06 23:21:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-04-06 23:21:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-06 23:21:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 23:21:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 206 ms
[2023-04-06 23:21:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 23:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-04-06 23:21:16] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-04-06 23:21:16] [INFO ] After 1144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
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 65 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-06 23:21:16] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-06 23:21:16] [INFO ] Computed 28 invariants in 9 ms
[2023-04-06 23:21:17] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-04-06 23:21:17] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:21:17] [INFO ] Invariant cache hit.
[2023-04-06 23:21:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:21:22] [INFO ] Implicit Places using invariants and state equation in 5039 ms returned []
Implicit Place search using SMT with State Equation took 5564 ms to find 0 implicit places.
[2023-04-06 23:21:22] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:21:22] [INFO ] Invariant cache hit.
[2023-04-06 23:21:23] [INFO ] Dead Transitions using invariants and state equation in 1013 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 6644 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 195 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 364 steps with 0 reset in 7 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 6907 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 43 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2023-04-06 23:21:23] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-06 23:21:23] [INFO ] Computed 28 invariants in 12 ms
[2023-04-06 23:21:24] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-04-06 23:21:24] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-06 23:21:24] [INFO ] Invariant cache hit.
[2023-04-06 23:21:24] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:21:28] [INFO ] Implicit Places using invariants and state equation in 4855 ms returned []
Implicit Place search using SMT with State Equation took 5351 ms to find 0 implicit places.
[2023-04-06 23:21:28] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-06 23:21:28] [INFO ] Invariant cache hit.
[2023-04-06 23:21:29] [INFO ] Dead Transitions using invariants and state equation in 1005 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 6409 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 285 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 841 ms.
Product exploration explored 100000 steps with 33333 reset in 732 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 22 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 8350 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 38 ms. Remains 821 /823 variables (removed 2) and now considering 3258/3276 (removed 18) transitions.
[2023-04-06 23:21:31] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
// Phase 1: matrix 1179 rows 821 cols
[2023-04-06 23:21:31] [INFO ] Computed 28 invariants in 5 ms
[2023-04-06 23:21:32] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-04-06 23:21:32] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-06 23:21:32] [INFO ] Invariant cache hit.
[2023-04-06 23:21:32] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-06 23:21:37] [INFO ] Implicit Places using invariants and state equation in 4781 ms returned []
Implicit Place search using SMT with State Equation took 5266 ms to find 0 implicit places.
[2023-04-06 23:21:37] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-06 23:21:37] [INFO ] Invariant cache hit.
[2023-04-06 23:21:38] [INFO ] Dead Transitions using invariants and state equation in 1039 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 6346 ms. Remains : 821/823 places, 3258/3276 transitions.
Stuttering acceptance computed with spot in 273 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 16636 reset in 542 ms.
Stack based approach found an accepted trace after 31271 steps with 5210 reset with depth 5 and stack size 5 in 174 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-03 finished in 7368 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 2 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 236 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2023-04-06 23:21:39] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-06 23:21:39] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:21:39] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-04-06 23:21:39] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:39] [INFO ] Invariant cache hit.
[2023-04-06 23:21:40] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:21:42] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 2646 ms to find 0 implicit places.
[2023-04-06 23:21:42] [INFO ] Redundant transitions in 147 ms returned []
[2023-04-06 23:21:42] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:42] [INFO ] Invariant cache hit.
[2023-04-06 23:21:43] [INFO ] Dead Transitions using invariants and state equation in 869 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 3906 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 120 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 308 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 4374 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 3 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 2 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 188 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2023-04-06 23:21:43] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-06 23:21:43] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:21:44] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-04-06 23:21:44] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:44] [INFO ] Invariant cache hit.
[2023-04-06 23:21:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:21:46] [INFO ] Implicit Places using invariants and state equation in 2468 ms returned []
Implicit Place search using SMT with State Equation took 2956 ms to find 0 implicit places.
[2023-04-06 23:21:46] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-06 23:21:46] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:46] [INFO ] Invariant cache hit.
[2023-04-06 23:21:47] [INFO ] Dead Transitions using invariants and state equation in 847 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 4069 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 99 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 272 ms.
Product exploration explored 100000 steps with 0 reset in 376 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 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 34 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 388 ms. (steps per millisecond=139 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 389 ms. (steps per millisecond=139 ) 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 100 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 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 104 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2023-04-06 23:21:49] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:49] [INFO ] Invariant cache hit.
[2023-04-06 23:21:49] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-04-06 23:21:49] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:49] [INFO ] Invariant cache hit.
[2023-04-06 23:21:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:21:52] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3019 ms to find 0 implicit places.
[2023-04-06 23:21:52] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:21:52] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:52] [INFO ] Invariant cache hit.
[2023-04-06 23:21:53] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4048 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 167 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 34 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 388 ms. (steps per millisecond=139 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 389 ms. (steps per millisecond=139 ) 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 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 282 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 91 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2023-04-06 23:21:54] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:54] [INFO ] Invariant cache hit.
[2023-04-06 23:21:55] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-04-06 23:21:55] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:55] [INFO ] Invariant cache hit.
[2023-04-06 23:21:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:21:57] [INFO ] Implicit Places using invariants and state equation in 2448 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2023-04-06 23:21:57] [INFO ] Redundant transitions in 73 ms returned []
[2023-04-06 23:21:57] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-06 23:21:57] [INFO ] Invariant cache hit.
[2023-04-06 23:21:58] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3967 ms. Remains : 487/487 places, 2908/2908 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-05 finished in 15254 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 39 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2023-04-06 23:21:58] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-06 23:21:58] [INFO ] Computed 28 invariants in 5 ms
[2023-04-06 23:21:59] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-04-06 23:21:59] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-06 23:21:59] [INFO ] Invariant cache hit.
[2023-04-06 23:21:59] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:03] [INFO ] Implicit Places using invariants and state equation in 4384 ms returned []
Implicit Place search using SMT with State Equation took 4916 ms to find 0 implicit places.
[2023-04-06 23:22:03] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-06 23:22:03] [INFO ] Invariant cache hit.
[2023-04-06 23:22:04] [INFO ] Dead Transitions using invariants and state equation in 1024 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 5982 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 123 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 235 ms.
Product exploration explored 100000 steps with 50 reset in 253 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 87 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 72 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 64 ms. (steps per millisecond=156 ) 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-06 23:22:05] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-06 23:22:05] [INFO ] Invariant cache hit.
[2023-04-06 23:22:05] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:22:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-04-06 23:22:05] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-06 23:22:06] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:06] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:06] [INFO ] After 159ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:06] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 1 ms to minimize.
[2023-04-06 23:22:06] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 1 ms to minimize.
[2023-04-06 23:22:07] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 1 ms to minimize.
[2023-04-06 23:22:07] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 1 ms to minimize.
[2023-04-06 23:22:07] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2023-04-06 23:22:07] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 1 ms to minimize.
[2023-04-06 23:22:08] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 1 ms to minimize.
[2023-04-06 23:22:08] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 1 ms to minimize.
[2023-04-06 23:22:08] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-04-06 23:22:08] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 0 ms to minimize.
[2023-04-06 23:22:08] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2023-04-06 23:22:09] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:22:09] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:22:09] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2845 ms
[2023-04-06 23:22:09] [INFO ] After 3072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-04-06 23:22:09] [INFO ] After 3593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 2 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 137 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 138 ms. Remains : 488/820 places, 2917/3249 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427580 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427580 steps, saw 261348 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:22:12] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-06 23:22:12] [INFO ] Computed 28 invariants in 21 ms
[2023-04-06 23:22:12] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:22:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 23:22:12] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:22:13] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:13] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:13] [INFO ] After 110ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:13] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2023-04-06 23:22:13] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-06 23:22:13] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-04-06 23:22:13] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2023-04-06 23:22:13] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 23:22:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1758 ms
[2023-04-06 23:22:14] [INFO ] After 1922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-04-06 23:22:15] [INFO ] After 2306ms 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 102 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 103 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 90 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:22:15] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:15] [INFO ] Invariant cache hit.
[2023-04-06 23:22:15] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-04-06 23:22:15] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:15] [INFO ] Invariant cache hit.
[2023-04-06 23:22:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:18] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
[2023-04-06 23:22:18] [INFO ] Redundant transitions in 74 ms returned []
[2023-04-06 23:22:18] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:18] [INFO ] Invariant cache hit.
[2023-04-06 23:22:19] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3936 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 33 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-06 23:22:19] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 23:22:19] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:22:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:22:19] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-06 23:22:19] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 23:22:19] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:19] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-06 23:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-04-06 23:22:19] [INFO ] After 53ms 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-06 23:22:19] [INFO ] After 128ms 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 145 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 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 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 2 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 153 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2023-04-06 23:22:19] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-06 23:22:19] [INFO ] Computed 28 invariants in 10 ms
[2023-04-06 23:22:20] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-04-06 23:22:20] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:20] [INFO ] Invariant cache hit.
[2023-04-06 23:22:20] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:22] [INFO ] Implicit Places using invariants and state equation in 2370 ms returned []
Implicit Place search using SMT with State Equation took 2827 ms to find 0 implicit places.
[2023-04-06 23:22:22] [INFO ] Redundant transitions in 76 ms returned []
[2023-04-06 23:22:22] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:22] [INFO ] Invariant cache hit.
[2023-04-06 23:22:23] [INFO ] Dead Transitions using invariants and state equation in 811 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 3873 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 77 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 79 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 49 ms. (steps per millisecond=204 ) 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-06 23:22:23] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:23] [INFO ] Invariant cache hit.
[2023-04-06 23:22:23] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:22:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:22:23] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:22:24] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:24] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:24] [INFO ] After 113ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:24] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-06 23:22:24] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2023-04-06 23:22:24] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-06 23:22:24] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 23:22:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1602 ms
[2023-04-06 23:22:25] [INFO ] After 1751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-04-06 23:22:25] [INFO ] After 2111ms 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 103 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 104 ms. Remains : 488/488 places, 2917/2917 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 434420 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434420 steps, saw 265284 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:22:29] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:29] [INFO ] Invariant cache hit.
[2023-04-06 23:22:29] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:22:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:22:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:22:29] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:29] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:29] [INFO ] After 117ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:29] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-04-06 23:22:29] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2023-04-06 23:22:30] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:22:31] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:22:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:22:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1591 ms
[2023-04-06 23:22:31] [INFO ] After 1742ms 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-06 23:22:31] [INFO ] After 2095ms 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 87 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 87 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 90 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:22:31] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:31] [INFO ] Invariant cache hit.
[2023-04-06 23:22:31] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-04-06 23:22:31] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:31] [INFO ] Invariant cache hit.
[2023-04-06 23:22:32] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:34] [INFO ] Implicit Places using invariants and state equation in 2557 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
[2023-04-06 23:22:34] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:22:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:34] [INFO ] Invariant cache hit.
[2023-04-06 23:22:35] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4041 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 1 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 1 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-06 23:22:35] [INFO ] Computed 21 invariants in 3 ms
[2023-04-06 23:22:35] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:22:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 23:22:35] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 23:22:35] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 23:22:35] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:22:35] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-06 23:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-04-06 23:22:35] [INFO ] After 57ms 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-06 23:22:35] [INFO ] After 132ms 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 149 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 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 92 reset in 252 ms.
Product exploration explored 100000 steps with 89 reset in 253 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 89 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:22:36] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-06 23:22:36] [INFO ] Computed 28 invariants in 9 ms
[2023-04-06 23:22:37] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-04-06 23:22:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:37] [INFO ] Invariant cache hit.
[2023-04-06 23:22:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:22:39] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
[2023-04-06 23:22:39] [INFO ] Redundant transitions in 78 ms returned []
[2023-04-06 23:22:39] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:22:39] [INFO ] Invariant cache hit.
[2023-04-06 23:22:40] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3974 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 41766 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 162 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2023-04-06 23:22:40] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-06 23:22:40] [INFO ] Computed 28 invariants in 7 ms
[2023-04-06 23:22:41] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-04-06 23:22:41] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:22:41] [INFO ] Invariant cache hit.
[2023-04-06 23:22:41] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:22:43] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
[2023-04-06 23:22:43] [INFO ] Redundant transitions in 74 ms returned []
[2023-04-06 23:22:43] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:22:43] [INFO ] Invariant cache hit.
[2023-04-06 23:22:44] [INFO ] Dead Transitions using invariants and state equation in 826 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 3937 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 262 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 270 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 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 237 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 263 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 280 ms. (steps per millisecond=35 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 173560 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173560 steps, saw 114923 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 10 properties.
[2023-04-06 23:22:49] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:22:49] [INFO ] Invariant cache hit.
[2023-04-06 23:22:49] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-06 23:22:49] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:22:49] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-04-06 23:22:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 23:22:49] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:22:50] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2023-04-06 23:22:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:22:50] [INFO ] After 204ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2023-04-06 23:22:50] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-04-06 23:22:50] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 0 ms to minimize.
[2023-04-06 23:22:50] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 1 ms to minimize.
[2023-04-06 23:22:51] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-06 23:22:51] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-04-06 23:22:51] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-04-06 23:22:51] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2023-04-06 23:22:51] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-04-06 23:22:51] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2198 ms
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:22:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-04-06 23:22:52] [INFO ] After 2792ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-04-06 23:22:53] [INFO ] After 3442ms 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 4 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 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 250770 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250770 steps, saw 160890 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:22:56] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:22:56] [INFO ] Invariant cache hit.
[2023-04-06 23:22:56] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-06 23:22:56] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:22:56] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:22:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-04-06 23:22:56] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:22:56] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:22:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:22:57] [INFO ] After 244ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:22:57] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-06 23:22:57] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-06 23:22:57] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2023-04-06 23:22:57] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:22:57] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1180 ms
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2023-04-06 23:22:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-04-06 23:22:58] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2023-04-06 23:22:59] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:22:59] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:22:59] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:22:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 591 ms
[2023-04-06 23:22:59] [INFO ] After 2505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-04-06 23:22:59] [INFO ] After 3118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
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 84 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 84 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 83 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2023-04-06 23:22:59] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:22:59] [INFO ] Invariant cache hit.
[2023-04-06 23:23:00] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-04-06 23:23:00] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:23:00] [INFO ] Invariant cache hit.
[2023-04-06 23:23:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:02] [INFO ] Implicit Places using invariants and state equation in 2411 ms returned []
Implicit Place search using SMT with State Equation took 2825 ms to find 0 implicit places.
[2023-04-06 23:23:02] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:23:02] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:23:02] [INFO ] Invariant cache hit.
[2023-04-06 23:23:03] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3834 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 33 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-06 23:23:03] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 23:23:03] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 23:23:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:23:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:23:03] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:23:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 23:23:03] [INFO ] After 51ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:23:03] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-06 23:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-06 23:23:03] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-06 23:23:03] [INFO ] After 281ms 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 19 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 23301 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 3 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 167 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2023-04-06 23:23:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 23:23:04] [INFO ] Computed 28 invariants in 7 ms
[2023-04-06 23:23:04] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-04-06 23:23:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:04] [INFO ] Invariant cache hit.
[2023-04-06 23:23:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:06] [INFO ] Implicit Places using invariants and state equation in 2380 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2023-04-06 23:23:06] [INFO ] Redundant transitions in 76 ms returned []
[2023-04-06 23:23:06] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:06] [INFO ] Invariant cache hit.
[2023-04-06 23:23:07] [INFO ] Dead Transitions using invariants and state equation in 815 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 3881 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 28 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 257 ms.
Product exploration explored 100000 steps with 0 reset in 313 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 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425560 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425560 steps, saw 261061 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:23:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:11] [INFO ] Invariant cache hit.
[2023-04-06 23:23:11] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:23:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 23:23:11] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-06 23:23:11] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:12] [INFO ] After 90ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:12] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2023-04-06 23:23:12] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 1 ms to minimize.
[2023-04-06 23:23:12] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2023-04-06 23:23:12] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 23:23:12] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2023-04-06 23:23:13] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-04-06 23:23:14] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 5 ms to minimize.
[2023-04-06 23:23:14] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-04-06 23:23:14] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:23:14] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:23:14] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2464 ms
[2023-04-06 23:23:14] [INFO ] After 2600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-06 23:23:14] [INFO ] After 2942ms 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 84 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 84 ms. Remains : 486/486 places, 2907/2907 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423730 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423730 steps, saw 259961 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:23:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:17] [INFO ] Invariant cache hit.
[2023-04-06 23:23:17] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:23:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:23:17] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:23:18] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:18] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:18] [INFO ] After 92ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:18] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 23:23:18] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 0 ms to minimize.
[2023-04-06 23:23:18] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-04-06 23:23:18] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2023-04-06 23:23:19] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:23:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2409 ms
[2023-04-06 23:23:20] [INFO ] After 2561ms 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-06 23:23:20] [INFO ] After 2905ms 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 91 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.
Starting structural reductions in REACHABILITY 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-06 23:23:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:20] [INFO ] Invariant cache hit.
[2023-04-06 23:23:21] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-04-06 23:23:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:21] [INFO ] Invariant cache hit.
[2023-04-06 23:23:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:23] [INFO ] Implicit Places using invariants and state equation in 2332 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
[2023-04-06 23:23:23] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:23:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:23] [INFO ] Invariant cache hit.
[2023-04-06 23:23:24] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3753 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 20 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-06 23:23:24] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 23:23:24] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:23:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 23:23:24] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 23:23:24] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-06 23:23:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-06 23:23:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-06 23:23:24] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-06 23:23:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 104 ms
[2023-04-06 23:23:24] [INFO ] After 125ms 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-06 23:23:24] [INFO ] After 196ms 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 86 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 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 91 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 23:23:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 23:23:25] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:23:25] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-04-06 23:23:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:25] [INFO ] Invariant cache hit.
[2023-04-06 23:23:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:27] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
[2023-04-06 23:23:27] [INFO ] Redundant transitions in 75 ms returned []
[2023-04-06 23:23:27] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:27] [INFO ] Invariant cache hit.
[2023-04-06 23:23:28] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3708 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 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) 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 423230 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423230 steps, saw 259574 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:23:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:31] [INFO ] Invariant cache hit.
[2023-04-06 23:23:31] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:23:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:23:31] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:23:32] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:32] [INFO ] After 101ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:32] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-04-06 23:23:32] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2023-04-06 23:23:32] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-04-06 23:23:33] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:23:34] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2430 ms
[2023-04-06 23:23:34] [INFO ] After 2587ms 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-06 23:23:34] [INFO ] After 2922ms 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 94 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 94 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 426280 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426280 steps, saw 261566 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:23:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:37] [INFO ] Invariant cache hit.
[2023-04-06 23:23:38] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:23:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:23:38] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:23:38] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:38] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:38] [INFO ] After 96ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:38] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-06 23:23:38] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 1 ms to minimize.
[2023-04-06 23:23:38] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-06 23:23:39] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-06 23:23:39] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2023-04-06 23:23:39] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2023-04-06 23:23:39] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-04-06 23:23:39] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-06 23:23:39] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:23:40] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2431 ms
[2023-04-06 23:23:40] [INFO ] After 2584ms 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-06 23:23:40] [INFO ] After 2924ms 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 84 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 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 23:23:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:41] [INFO ] Invariant cache hit.
[2023-04-06 23:23:41] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-04-06 23:23:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:41] [INFO ] Invariant cache hit.
[2023-04-06 23:23:41] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:43] [INFO ] Implicit Places using invariants and state equation in 2320 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
[2023-04-06 23:23:43] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:23:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:43] [INFO ] Invariant cache hit.
[2023-04-06 23:23:44] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3749 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 21 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-06 23:23:44] [INFO ] Computed 19 invariants in 0 ms
[2023-04-06 23:23:44] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:23:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:23:44] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 23:23:44] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:23:44] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-06 23:23:44] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-06 23:23:44] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-06 23:23:44] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-06 23:23:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 107 ms
[2023-04-06 23:23:44] [INFO ] After 126ms 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-06 23:23:45] [INFO ] After 199ms 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 78 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 252 ms.
Product exploration explored 100000 steps with 0 reset in 295 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 92 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 23:23:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 23:23:45] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:23:46] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-04-06 23:23:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:46] [INFO ] Invariant cache hit.
[2023-04-06 23:23:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:48] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 2743 ms to find 0 implicit places.
[2023-04-06 23:23:48] [INFO ] Redundant transitions in 76 ms returned []
[2023-04-06 23:23:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 23:23:48] [INFO ] Invariant cache hit.
[2023-04-06 23:23:49] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3716 ms. Remains : 486/486 places, 2907/2907 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-09 finished in 45642 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 34 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-06 23:23:49] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-06 23:23:49] [INFO ] Computed 28 invariants in 8 ms
[2023-04-06 23:23:50] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-04-06 23:23:50] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:23:50] [INFO ] Invariant cache hit.
[2023-04-06 23:23:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:53] [INFO ] Implicit Places using invariants and state equation in 3898 ms returned []
Implicit Place search using SMT with State Equation took 4372 ms to find 0 implicit places.
[2023-04-06 23:23:53] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:23:53] [INFO ] Invariant cache hit.
[2023-04-06 23:23:54] [INFO ] Dead Transitions using invariants and state equation in 986 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 5392 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 149 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 242 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 5806 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 163 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2023-04-06 23:23:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-06 23:23:55] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:23:55] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-04-06 23:23:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:23:55] [INFO ] Invariant cache hit.
[2023-04-06 23:23:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:23:58] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
[2023-04-06 23:23:58] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:23:58] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:23:58] [INFO ] Invariant cache hit.
[2023-04-06 23:23:59] [INFO ] Dead Transitions using invariants and state equation in 833 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 3738 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 251 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 238 ms.
Product exploration explored 100000 steps with 0 reset in 289 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 113 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 123 ms :[(NOT p3), true, p2, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:24:00] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:24:00] [INFO ] Invariant cache hit.
[2023-04-06 23:24:00] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:24:00] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:24:00] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:24:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:24:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:24:00] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:24:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:24:01] [INFO ] After 202ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:24:01] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 1 ms to minimize.
[2023-04-06 23:24:01] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-04-06 23:24:01] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 1 ms to minimize.
[2023-04-06 23:24:01] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2023-04-06 23:24:02] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 0 ms to minimize.
[2023-04-06 23:24:02] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2023-04-06 23:24:02] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2023-04-06 23:24:02] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-04-06 23:24:02] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-04-06 23:24:03] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2023-04-06 23:24:03] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-04-06 23:24:03] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2023-04-06 23:24:03] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 0 ms to minimize.
[2023-04-06 23:24:03] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 0 ms to minimize.
[2023-04-06 23:24:04] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-04-06 23:24:04] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2023-04-06 23:24:04] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 0 ms to minimize.
[2023-04-06 23:24:04] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4102 ms
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 498 ms
[2023-04-06 23:24:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 23:24:05] [INFO ] After 5102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-04-06 23:24:06] [INFO ] After 5667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 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 96 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 96 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 274140 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274140 steps, saw 175460 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:24:09] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:24:09] [INFO ] Invariant cache hit.
[2023-04-06 23:24:09] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 23:24:09] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:24:09] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:24:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:24:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:24:09] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:24:09] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:24:10] [INFO ] After 192ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:24:10] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-04-06 23:24:10] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-04-06 23:24:10] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-06 23:24:10] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-06 23:24:11] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2023-04-06 23:24:11] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 0 ms to minimize.
[2023-04-06 23:24:11] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 1 ms to minimize.
[2023-04-06 23:24:11] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2023-04-06 23:24:11] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-04-06 23:24:12] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2023-04-06 23:24:12] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 4 ms to minimize.
[2023-04-06 23:24:12] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-04-06 23:24:12] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 0 ms to minimize.
[2023-04-06 23:24:12] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-04-06 23:24:13] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 1 ms to minimize.
[2023-04-06 23:24:13] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2023-04-06 23:24:13] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 0 ms to minimize.
[2023-04-06 23:24:13] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4120 ms
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 489 ms
[2023-04-06 23:24:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 23:24:14] [INFO ] After 5106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-04-06 23:24:15] [INFO ] After 5673ms 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 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 82 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2023-04-06 23:24:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:24:15] [INFO ] Invariant cache hit.
[2023-04-06 23:24:15] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-04-06 23:24:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:24:15] [INFO ] Invariant cache hit.
[2023-04-06 23:24:15] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:24:17] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
[2023-04-06 23:24:18] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-06 23:24:18] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-06 23:24:18] [INFO ] Invariant cache hit.
[2023-04-06 23:24:18] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3627 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 0 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 28 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-06 23:24:18] [INFO ] Computed 20 invariants in 0 ms
[2023-04-06 23:24:18] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:24:18] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:24:18] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:24:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:24:18] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:24:19] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:24:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 23:24:19] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:24:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-06 23:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-06 23:24:19] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-06 23:24:19] [INFO ] After 256ms 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 186 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 144 ms :[(NOT p3), true, p2, (NOT p3)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p3), true, p2, (NOT p3)]
[2023-04-06 23:24:19] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-06 23:24:19] [INFO ] Computed 28 invariants in 2 ms
[2023-04-06 23:24:20] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2023-04-06 23:24:20] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 16 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 176 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 25480 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 38 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-06 23:24:20] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-06 23:24:20] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:24:21] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-04-06 23:24:21] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:24:21] [INFO ] Invariant cache hit.
[2023-04-06 23:24:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:24:26] [INFO ] Implicit Places using invariants and state equation in 4853 ms returned []
Implicit Place search using SMT with State Equation took 5364 ms to find 0 implicit places.
[2023-04-06 23:24:26] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:24:26] [INFO ] Invariant cache hit.
[2023-04-06 23:24:27] [INFO ] Dead Transitions using invariants and state equation in 965 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 6372 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 104 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 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-12 finished in 6502 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 39 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-06 23:24:27] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:24:27] [INFO ] Invariant cache hit.
[2023-04-06 23:24:27] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-04-06 23:24:27] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:24:27] [INFO ] Invariant cache hit.
[2023-04-06 23:24:28] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 23:24:32] [INFO ] Implicit Places using invariants and state equation in 4929 ms returned []
Implicit Place search using SMT with State Equation took 5393 ms to find 0 implicit places.
[2023-04-06 23:24:32] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-06 23:24:32] [INFO ] Invariant cache hit.
[2023-04-06 23:24:33] [INFO ] Dead Transitions using invariants and state equation in 999 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 6432 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 99 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 240 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 6790 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 101 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 101 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2023-04-06 23:24:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-06 23:24:34] [INFO ] Computed 28 invariants in 3 ms
[2023-04-06 23:24:34] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-04-06 23:24:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:34] [INFO ] Invariant cache hit.
[2023-04-06 23:24:35] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:24:37] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2023-04-06 23:24:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:37] [INFO ] Invariant cache hit.
[2023-04-06 23:24:38] [INFO ] Dead Transitions using invariants and state equation in 845 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 3682 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 91 reset in 237 ms.
Product exploration explored 100000 steps with 89 reset in 245 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 81 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 75 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 39 ms. (steps per millisecond=256 ) 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-06 23:24:38] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:38] [INFO ] Invariant cache hit.
[2023-04-06 23:24:38] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:24:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:24:38] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:24:39] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:39] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:24:39] [INFO ] After 120ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:39] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-06 23:24:39] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 23:24:39] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-06 23:24:39] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 8 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-04-06 23:24:40] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:24:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1698 ms
[2023-04-06 23:24:41] [INFO ] After 1857ms 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-06 23:24:41] [INFO ] After 2189ms 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 444910 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 444910 steps, saw 271231 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:24:44] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:44] [INFO ] Invariant cache hit.
[2023-04-06 23:24:44] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:24:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-06 23:24:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:24:44] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:44] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:24:44] [INFO ] After 119ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:44] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2023-04-06 23:24:45] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-06 23:24:46] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:24:46] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:24:46] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:24:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:24:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1691 ms
[2023-04-06 23:24:46] [INFO ] After 1852ms 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-06 23:24:46] [INFO ] After 2197ms 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 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 87 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:24:46] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:46] [INFO ] Invariant cache hit.
[2023-04-06 23:24:47] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-04-06 23:24:47] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:47] [INFO ] Invariant cache hit.
[2023-04-06 23:24:47] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:24:49] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 2644 ms to find 0 implicit places.
[2023-04-06 23:24:49] [INFO ] Redundant transitions in 80 ms returned []
[2023-04-06 23:24:49] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:49] [INFO ] Invariant cache hit.
[2023-04-06 23:24:50] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3625 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 19 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-06 23:24:50] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 23:24:50] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:24:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:24:50] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 23:24:50] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 23:24:50] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:50] [INFO ] After 27ms 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-06 23:24:50] [INFO ] After 103ms 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 145 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 68 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 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 85 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:24:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-06 23:24:50] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 23:24:51] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-04-06 23:24:51] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:51] [INFO ] Invariant cache hit.
[2023-04-06 23:24:51] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:24:53] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
[2023-04-06 23:24:53] [INFO ] Redundant transitions in 79 ms returned []
[2023-04-06 23:24:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:53] [INFO ] Invariant cache hit.
[2023-04-06 23:24:54] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3717 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 69 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 67 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:24:54] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:54] [INFO ] Invariant cache hit.
[2023-04-06 23:24:54] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:24:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 23:24:54] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 23:24:54] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:54] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:24:55] [INFO ] After 120ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:24:55] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2023-04-06 23:24:55] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:24:55] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:24:55] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:24:55] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:24:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1687 ms
[2023-04-06 23:24:56] [INFO ] After 1844ms 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-06 23:24:56] [INFO ] After 2178ms 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 94 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 94 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 442300 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 442300 steps, saw 269662 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:24:59] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:24:59] [INFO ] Invariant cache hit.
[2023-04-06 23:25:00] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:25:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 23:25:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 23:25:00] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:25:00] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:25:00] [INFO ] After 116ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:25:00] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-06 23:25:00] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-06 23:25:00] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2023-04-06 23:25:01] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-04-06 23:25:02] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:25:02] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-04-06 23:25:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1708 ms
[2023-04-06 23:25:02] [INFO ] After 1864ms 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-06 23:25:02] [INFO ] After 2202ms 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 88 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:25:02] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:25:02] [INFO ] Invariant cache hit.
[2023-04-06 23:25:02] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-04-06 23:25:02] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:25:02] [INFO ] Invariant cache hit.
[2023-04-06 23:25:03] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:25:05] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
[2023-04-06 23:25:05] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-06 23:25:05] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:25:05] [INFO ] Invariant cache hit.
[2023-04-06 23:25:05] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3628 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 1 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 23 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-06 23:25:05] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 23:25:06] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:25:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 23:25:06] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-06 23:25:06] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:25:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 23:25:06] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:25:06] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-06 23:25:06] [INFO ] After 98ms 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 120 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 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 92 reset in 231 ms.
Product exploration explored 100000 steps with 88 reset in 236 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 84 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-06 23:25:07] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-06 23:25:07] [INFO ] Computed 28 invariants in 7 ms
[2023-04-06 23:25:07] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-04-06 23:25:07] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:25:07] [INFO ] Invariant cache hit.
[2023-04-06 23:25:07] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 23:25:09] [INFO ] Implicit Places using invariants and state equation in 2266 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2023-04-06 23:25:09] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 23:25:09] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-06 23:25:09] [INFO ] Invariant cache hit.
[2023-04-06 23:25:10] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3681 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 36442 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-06 23:25:10] [INFO ] Flatten gal took : 112 ms
[2023-04-06 23:25:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-06 23:25:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 823 places, 3276 transitions and 16344 arcs took 22 ms.
Total runtime 307756 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-09
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1680823917538

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 EisenbergMcGuire-PT-09-LTLFireability-09
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1199 2/32 EisenbergMcGuire-PT-09-LTLFireability-09 91499 m, 18299 m/sec, 221856 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1199 3/32 EisenbergMcGuire-PT-09-LTLFireability-09 194584 m, 20617 m/sec, 499521 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/1199 4/32 EisenbergMcGuire-PT-09-LTLFireability-09 289210 m, 18925 m/sec, 770966 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 19/1199 5/32 EisenbergMcGuire-PT-09-LTLFireability-09 385665 m, 19291 m/sec, 1051443 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 24/1199 6/32 EisenbergMcGuire-PT-09-LTLFireability-09 476511 m, 18169 m/sec, 1341901 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 29/1199 7/32 EisenbergMcGuire-PT-09-LTLFireability-09 576104 m, 19918 m/sec, 1656901 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 34/1199 8/32 EisenbergMcGuire-PT-09-LTLFireability-09 665822 m, 17943 m/sec, 2001228 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 39/1199 9/32 EisenbergMcGuire-PT-09-LTLFireability-09 758237 m, 18483 m/sec, 2328833 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 44/1199 10/32 EisenbergMcGuire-PT-09-LTLFireability-09 851960 m, 18744 m/sec, 2651945 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 49/1199 11/32 EisenbergMcGuire-PT-09-LTLFireability-09 945589 m, 18725 m/sec, 2974204 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 54/1199 12/32 EisenbergMcGuire-PT-09-LTLFireability-09 1035026 m, 17887 m/sec, 3266731 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 59/1199 12/32 EisenbergMcGuire-PT-09-LTLFireability-09 1125028 m, 18000 m/sec, 3584568 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 64/1199 13/32 EisenbergMcGuire-PT-09-LTLFireability-09 1213901 m, 17774 m/sec, 3894461 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 69/1199 14/32 EisenbergMcGuire-PT-09-LTLFireability-09 1308972 m, 19014 m/sec, 4211487 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 74/1199 15/32 EisenbergMcGuire-PT-09-LTLFireability-09 1403671 m, 18939 m/sec, 4552874 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 79/1199 16/32 EisenbergMcGuire-PT-09-LTLFireability-09 1495372 m, 18340 m/sec, 4877985 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 84/1199 17/32 EisenbergMcGuire-PT-09-LTLFireability-09 1590833 m, 19092 m/sec, 5183328 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 89/1199 18/32 EisenbergMcGuire-PT-09-LTLFireability-09 1684830 m, 18799 m/sec, 5505794 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 94/1199 19/32 EisenbergMcGuire-PT-09-LTLFireability-09 1782407 m, 19515 m/sec, 5846183 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 99/1199 20/32 EisenbergMcGuire-PT-09-LTLFireability-09 1876845 m, 18887 m/sec, 6177121 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 104/1199 21/32 EisenbergMcGuire-PT-09-LTLFireability-09 1967573 m, 18145 m/sec, 6487309 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 109/1199 22/32 EisenbergMcGuire-PT-09-LTLFireability-09 2054620 m, 17409 m/sec, 6806573 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 114/1199 23/32 EisenbergMcGuire-PT-09-LTLFireability-09 2145858 m, 18247 m/sec, 7163217 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 119/1199 24/32 EisenbergMcGuire-PT-09-LTLFireability-09 2238874 m, 18603 m/sec, 7489921 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 124/1199 24/32 EisenbergMcGuire-PT-09-LTLFireability-09 2332196 m, 18664 m/sec, 7844167 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 129/1199 25/32 EisenbergMcGuire-PT-09-LTLFireability-09 2420583 m, 17677 m/sec, 8174012 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 134/1199 26/32 EisenbergMcGuire-PT-09-LTLFireability-09 2513890 m, 18661 m/sec, 8494477 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 139/1199 27/32 EisenbergMcGuire-PT-09-LTLFireability-09 2610761 m, 19374 m/sec, 8845398 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 144/1199 28/32 EisenbergMcGuire-PT-09-LTLFireability-09 2706393 m, 19126 m/sec, 9234822 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 149/1199 29/32 EisenbergMcGuire-PT-09-LTLFireability-09 2793228 m, 17367 m/sec, 9559435 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 154/1199 30/32 EisenbergMcGuire-PT-09-LTLFireability-09 2882935 m, 17941 m/sec, 9921037 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 159/1199 31/32 EisenbergMcGuire-PT-09-LTLFireability-09 2970211 m, 17455 m/sec, 10245898 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 164/1199 32/32 EisenbergMcGuire-PT-09-LTLFireability-09 3061029 m, 18163 m/sec, 10567107 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 169/1199 32/32 EisenbergMcGuire-PT-09-LTLFireability-09 3152899 m, 18374 m/sec, 10903824 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for EisenbergMcGuire-PT-09-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 EisenbergMcGuire-PT-09-LTLFireability-07
lola: time limit : 1712 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1712 3/32 EisenbergMcGuire-PT-09-LTLFireability-07 302779 m, 60555 m/sec, 872308 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1712 6/32 EisenbergMcGuire-PT-09-LTLFireability-07 586307 m, 56705 m/sec, 1726156 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1712 8/32 EisenbergMcGuire-PT-09-LTLFireability-07 868469 m, 56432 m/sec, 2578477 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1712 10/32 EisenbergMcGuire-PT-09-LTLFireability-07 1147395 m, 55785 m/sec, 3414621 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1712 12/32 EisenbergMcGuire-PT-09-LTLFireability-07 1389477 m, 48416 m/sec, 4312125 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1712 14/32 EisenbergMcGuire-PT-09-LTLFireability-07 1657915 m, 53687 m/sec, 5169605 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1712 16/32 EisenbergMcGuire-PT-09-LTLFireability-07 1909178 m, 50252 m/sec, 6066733 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1712 18/32 EisenbergMcGuire-PT-09-LTLFireability-07 2172826 m, 52729 m/sec, 6957288 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1712 20/32 EisenbergMcGuire-PT-09-LTLFireability-07 2434043 m, 52243 m/sec, 7816754 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1712 22/32 EisenbergMcGuire-PT-09-LTLFireability-07 2708276 m, 54846 m/sec, 8703142 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1712 24/32 EisenbergMcGuire-PT-09-LTLFireability-07 3003261 m, 58997 m/sec, 9587897 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1712 26/32 EisenbergMcGuire-PT-09-LTLFireability-07 3293341 m, 58016 m/sec, 10460169 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1712 29/32 EisenbergMcGuire-PT-09-LTLFireability-07 3585668 m, 58465 m/sec, 11337386 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1712 31/32 EisenbergMcGuire-PT-09-LTLFireability-07 3875025 m, 57871 m/sec, 12205405 t fired, .

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for EisenbergMcGuire-PT-09-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 EisenbergMcGuire-PT-09-LTLFireability-05
lola: time limit : 3350 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3350 2/32 EisenbergMcGuire-PT-09-LTLFireability-05 101922 m, 20384 m/sec, 216525 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3350 3/32 EisenbergMcGuire-PT-09-LTLFireability-05 203283 m, 20272 m/sec, 440763 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3350 4/32 EisenbergMcGuire-PT-09-LTLFireability-05 306165 m, 20576 m/sec, 673812 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3350 5/32 EisenbergMcGuire-PT-09-LTLFireability-05 406662 m, 20099 m/sec, 901986 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3350 6/32 EisenbergMcGuire-PT-09-LTLFireability-05 506933 m, 20054 m/sec, 1125113 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3350 7/32 EisenbergMcGuire-PT-09-LTLFireability-05 606721 m, 19957 m/sec, 1352877 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3350 8/32 EisenbergMcGuire-PT-09-LTLFireability-05 707710 m, 20197 m/sec, 1604551 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3350 9/32 EisenbergMcGuire-PT-09-LTLFireability-05 808308 m, 20119 m/sec, 1841751 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3350 10/32 EisenbergMcGuire-PT-09-LTLFireability-05 907937 m, 19925 m/sec, 2079970 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3350 11/32 EisenbergMcGuire-PT-09-LTLFireability-05 1008590 m, 20130 m/sec, 2318625 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3350 12/32 EisenbergMcGuire-PT-09-LTLFireability-05 1107460 m, 19774 m/sec, 2601906 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3350 13/32 EisenbergMcGuire-PT-09-LTLFireability-05 1207242 m, 19956 m/sec, 2838673 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3350 14/32 EisenbergMcGuire-PT-09-LTLFireability-05 1307512 m, 20054 m/sec, 3076537 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3350 15/32 EisenbergMcGuire-PT-09-LTLFireability-05 1407833 m, 20064 m/sec, 3318616 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3350 16/32 EisenbergMcGuire-PT-09-LTLFireability-05 1507182 m, 19869 m/sec, 3553522 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3350 17/32 EisenbergMcGuire-PT-09-LTLFireability-05 1607860 m, 20135 m/sec, 3813057 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3350 19/32 EisenbergMcGuire-PT-09-LTLFireability-05 1709126 m, 20253 m/sec, 4059136 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3350 20/32 EisenbergMcGuire-PT-09-LTLFireability-05 1810379 m, 20250 m/sec, 4319370 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3350 20/32 EisenbergMcGuire-PT-09-LTLFireability-05 1906551 m, 19234 m/sec, 4572222 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3350 21/32 EisenbergMcGuire-PT-09-LTLFireability-05 2007644 m, 20218 m/sec, 4818179 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3350 23/32 EisenbergMcGuire-PT-09-LTLFireability-05 2108407 m, 20152 m/sec, 5062370 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3350 24/32 EisenbergMcGuire-PT-09-LTLFireability-05 2209514 m, 20221 m/sec, 5316229 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3350 25/32 EisenbergMcGuire-PT-09-LTLFireability-05 2309368 m, 19970 m/sec, 5559723 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3350 26/32 EisenbergMcGuire-PT-09-LTLFireability-05 2410253 m, 20177 m/sec, 5815534 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3350 27/32 EisenbergMcGuire-PT-09-LTLFireability-05 2511622 m, 20273 m/sec, 6069837 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3350 28/32 EisenbergMcGuire-PT-09-LTLFireability-05 2609272 m, 19530 m/sec, 6367683 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3350 29/32 EisenbergMcGuire-PT-09-LTLFireability-05 2704253 m, 18996 m/sec, 6634331 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3350 30/32 EisenbergMcGuire-PT-09-LTLFireability-05 2799365 m, 19022 m/sec, 6925982 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3350 31/32 EisenbergMcGuire-PT-09-LTLFireability-05 2899618 m, 20050 m/sec, 7173365 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3350 32/32 EisenbergMcGuire-PT-09-LTLFireability-05 2998826 m, 19841 m/sec, 7415334 t fired, .

Time elapsed: 400 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for EisenbergMcGuire-PT-09-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-09-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
EisenbergMcGuire-PT-09-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 405 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-09-LTLFireability-05: LTL unknown AGGR
EisenbergMcGuire-PT-09-LTLFireability-07: LTL unknown AGGR
EisenbergMcGuire-PT-09-LTLFireability-09: LTL unknown AGGR


Time elapsed: 405 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r519-tall-167987245000268"
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 ;