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-167987245000244.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-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 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 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 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 753K 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-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680818913843

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-06
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:08:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:08:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:08:35] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-04-06 22:08:35] [INFO ] Transformed 414 places.
[2023-04-06 22:08:35] [INFO ] Transformed 1296 transitions.
[2023-04-06 22:08:35] [INFO ] Found NUPN structural information;
[2023-04-06 22:08:35] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 387 transition count 1134
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 387 transition count 1134
Applied a total of 54 rules in 62 ms. Remains 387 /414 variables (removed 27) and now considering 1134/1296 (removed 162) transitions.
[2023-04-06 22:08:35] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
// Phase 1: matrix 540 rows 387 cols
[2023-04-06 22:08:35] [INFO ] Computed 19 invariants in 27 ms
[2023-04-06 22:08:36] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-04-06 22:08:36] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-06 22:08:36] [INFO ] Invariant cache hit.
[2023-04-06 22:08:36] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 22:08:36] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2023-04-06 22:08:37] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-06 22:08:37] [INFO ] Invariant cache hit.
[2023-04-06 22:08:37] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 387/414 places, 1134/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1538 ms. Remains : 387/414 places, 1134/1296 transitions.
Support contains 47 out of 387 places after structural reductions.
[2023-04-06 22:08:37] [INFO ] Flatten gal took : 95 ms
[2023-04-06 22:08:37] [INFO ] Flatten gal took : 62 ms
[2023-04-06 22:08:37] [INFO ] Input system was already deterministic with 1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-04-06 22:08:38] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-06 22:08:38] [INFO ] Invariant cache hit.
[2023-04-06 22:08:38] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 22:08:38] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:08:38] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-06 22:08:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 22:08:39] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:08:39] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-06 22:08:39] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 22:08:40] [INFO ] After 579ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-06 22:08:40] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 5 ms to minimize.
[2023-04-06 22:08:40] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2023-04-06 22:08:40] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-04-06 22:08:40] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-06 22:08:40] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-04-06 22:08:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 652 ms
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 4 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2023-04-06 22:08:41] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2023-04-06 22:08:43] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-04-06 22:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 22:08:43] [INFO ] After 3660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 627 ms.
[2023-04-06 22:08:44] [INFO ] After 5164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 391 ms.
Support contains 31 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 12 place count 381 transition count 1019
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 230 place count 272 transition count 1019
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 290 place count 242 transition count 989
Applied a total of 290 rules in 105 ms. Remains 242 /387 variables (removed 145) and now considering 989/1134 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 242/387 places, 989/1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 367983 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{0=1, 3=1, 4=1, 6=1, 8=1, 9=1, 10=1, 11=1, 13=1, 15=1, 16=1}
Probabilistic random walk after 367983 steps, saw 115574 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :11
Running SMT prover for 6 properties.
[2023-04-06 22:08:47] [INFO ] Flow matrix only has 395 transitions (discarded 594 similar events)
// Phase 1: matrix 395 rows 242 cols
[2023-04-06 22:08:47] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:08:47] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 22:08:47] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:08:47] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 22:08:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-04-06 22:08:48] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:08:48] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 22:08:48] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 22:08:48] [INFO ] After 129ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 22:08:48] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-04-06 22:08:48] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-06 22:08:48] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-04-06 22:08:48] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:08:48] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2023-04-06 22:08:48] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 970 ms
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 22:08:49] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2023-04-06 22:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 22:08:49] [INFO ] After 1649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-04-06 22:08:50] [INFO ] After 2058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 45 ms.
Support contains 12 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 989/989 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 242 transition count 985
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 238 transition count 985
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 236 transition count 973
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 236 transition count 973
Applied a total of 12 rules in 71 ms. Remains 236 /242 variables (removed 6) and now considering 973/989 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 236/242 places, 973/989 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 412391 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 412391 steps, saw 120247 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-06 22:08:53] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
// Phase 1: matrix 379 rows 236 cols
[2023-04-06 22:08:53] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:08:53] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:08:53] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:08:53] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 22:08:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:08:53] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:08:53] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 22:08:53] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:08:53] [INFO ] After 140ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 604 ms
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-04-06 22:08:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:08:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 22:08:54] [INFO ] After 1008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-04-06 22:08:54] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 18 ms.
Support contains 12 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 973/973 transitions.
Applied a total of 0 rules in 28 ms. Remains 236 /236 variables (removed 0) and now considering 973/973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 236/236 places, 973/973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 973/973 transitions.
Applied a total of 0 rules in 26 ms. Remains 236 /236 variables (removed 0) and now considering 973/973 (removed 0) transitions.
[2023-04-06 22:08:55] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-06 22:08:55] [INFO ] Invariant cache hit.
[2023-04-06 22:08:55] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-04-06 22:08:55] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-06 22:08:55] [INFO ] Invariant cache hit.
[2023-04-06 22:08:55] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:08:56] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2023-04-06 22:08:56] [INFO ] Redundant transitions in 59 ms returned []
[2023-04-06 22:08:56] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-06 22:08:56] [INFO ] Invariant cache hit.
[2023-04-06 22:08:56] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1402 ms. Remains : 236/236 places, 973/973 transitions.
Graph (trivial) has 813 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 4 ms
Free SCC test removed 30 places
Drop transitions removed 112 transitions
Ensure Unique test removed 575 transitions
Reduce isomorphic transitions removed 687 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 206 transition count 244
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 164 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 163 transition count 243
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 87 place count 163 transition count 231
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 116 place count 146 transition count 231
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 226 place count 91 transition count 176
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 249 place count 91 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 257 place count 87 transition count 172
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 87 transition count 169
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 270 place count 87 transition count 159
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 300 place count 87 transition count 129
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 330 place count 57 transition count 129
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 342 place count 57 transition count 129
Applied a total of 342 rules in 31 ms. Remains 57 /236 variables (removed 179) and now considering 129/973 (removed 844) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 129 rows 57 cols
[2023-04-06 22:08:56] [INFO ] Computed 14 invariants in 1 ms
[2023-04-06 22:08:56] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:08:56] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:08:56] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 22:08:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:08:56] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:08:56] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 22:08:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 22:08:56] [INFO ] After 45ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 22:08:56] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-06 22:08:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2023-04-06 22:08:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-04-06 22:08:56] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:08:56] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 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(F(X(F(X(F(((X(p0) U p1)&&X(p2)))))))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 17 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:08:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:08:57] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 22:08:57] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-04-06 22:08:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:08:57] [INFO ] Invariant cache hit.
[2023-04-06 22:08:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:08:58] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-04-06 22:08:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:08:58] [INFO ] Invariant cache hit.
[2023-04-06 22:08:58] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1601 ms. Remains : 384/387 places, 1116/1134 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 362 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s19 1) (EQ s80 1)), p2:(EQ s121 1), p0:(AND (EQ s0 1) (EQ s8 1) (EQ s254 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15 reset in 341 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 2362 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)||G(p1)||(X(X(p0))&&X(p0)))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 19 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:08:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:08:59] [INFO ] Invariant cache hit.
[2023-04-06 22:08:59] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-04-06 22:08:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:08:59] [INFO ] Invariant cache hit.
[2023-04-06 22:08:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:00] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2023-04-06 22:09:00] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:00] [INFO ] Invariant cache hit.
[2023-04-06 22:09:00] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1485 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s277 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 225 ms.
Product exploration explored 100000 steps with 0 reset in 348 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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 290486 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290486 steps, saw 175140 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:09:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:05] [INFO ] Invariant cache hit.
[2023-04-06 22:09:05] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 22:09:05] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 22:09:05] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 22:09:05] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:09:05] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:05] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:05] [INFO ] After 133ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:05] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 4 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 905 ms
[2023-04-06 22:09:06] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2023-04-06 22:09:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 22:09:06] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-04-06 22:09:07] [INFO ] After 1705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 41 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 410704 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 410704 steps, saw 110300 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:09:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:09:10] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:09:10] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:10] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:09:10] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 22:09:10] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:10] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:10] [INFO ] After 100ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 463 ms
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-06 22:09:11] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-06 22:09:11] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-04-06 22:09:11] [INFO ] After 1077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:09:11] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:09:11] [INFO ] Invariant cache hit.
[2023-04-06 22:09:11] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-06 22:09:11] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:09:11] [INFO ] Invariant cache hit.
[2023-04-06 22:09:12] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:12] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2023-04-06 22:09:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 22:09:12] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:09:12] [INFO ] Invariant cache hit.
[2023-04-06 22:09:12] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1106 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 17 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 22:09:12] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:09:12] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:12] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:12] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:09:12] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-06 22:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 22:09:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-06 22:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-06 22:09:13] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:09:13] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 22:09:13] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:09:13] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 22:09:13] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-04-06 22:09:13] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:13] [INFO ] Invariant cache hit.
[2023-04-06 22:09:13] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:14] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2023-04-06 22:09:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:14] [INFO ] Invariant cache hit.
[2023-04-06 22:09:14] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1537 ms. Remains : 384/384 places, 1116/1116 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 (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 262227 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262227 steps, saw 160195 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:09:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:18] [INFO ] Invariant cache hit.
[2023-04-06 22:09:18] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 22:09:18] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 22:09:18] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 22:09:18] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:09:19] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:19] [INFO ] After 131ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:09:19] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:09:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 864 ms
[2023-04-06 22:09:20] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2023-04-06 22:09:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 22:09:20] [INFO ] After 1244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-04-06 22:09:20] [INFO ] After 1681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 47 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 435197 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435197 steps, saw 117410 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:09:23] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:09:23] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 22:09:23] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:23] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:23] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:23] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:24] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:24] [INFO ] After 96ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 472 ms
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-04-06 22:09:24] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:09:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 22:09:24] [INFO ] After 799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-04-06 22:09:25] [INFO ] After 1071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:09:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:09:25] [INFO ] Invariant cache hit.
[2023-04-06 22:09:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-04-06 22:09:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:09:25] [INFO ] Invariant cache hit.
[2023-04-06 22:09:25] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:25] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-04-06 22:09:25] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 22:09:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:09:25] [INFO ] Invariant cache hit.
[2023-04-06 22:09:26] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1115 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 16 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 22:09:26] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:09:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:26] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:26] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:09:26] [INFO ] After 19ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:09:26] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-06 22:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-06 22:09:26] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-06 22:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-06 22:09:26] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 22:09:26] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 205 ms.
Product exploration explored 100000 steps with 0 reset in 300 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 22:09:27] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:09:27] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 22:09:27] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-04-06 22:09:27] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:27] [INFO ] Invariant cache hit.
[2023-04-06 22:09:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:28] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2023-04-06 22:09:28] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:28] [INFO ] Invariant cache hit.
[2023-04-06 22:09:29] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 29861 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(p1)&&F(p2)&&p0))))'
Support contains 7 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 14 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:09:29] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:29] [INFO ] Invariant cache hit.
[2023-04-06 22:09:29] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-04-06 22:09:29] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:29] [INFO ] Invariant cache hit.
[2023-04-06 22:09:29] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:30] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-04-06 22:09:30] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:30] [INFO ] Invariant cache hit.
[2023-04-06 22:09:30] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1573 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s357 1)), p1:(AND (EQ s0 1) (EQ s340 1)), p2:(AND (EQ s4 1) (EQ s18 1) (EQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-02 finished in 1783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 381 transition count 1015
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 268 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 265 transition count 997
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 967
Applied a total of 304 rules in 66 ms. Remains 235 /387 variables (removed 152) and now considering 967/1134 (removed 167) transitions.
[2023-04-06 22:09:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2023-04-06 22:09:31] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:09:31] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-04-06 22:09:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2023-04-06 22:09:31] [INFO ] Invariant cache hit.
[2023-04-06 22:09:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:31] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-04-06 22:09:31] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-06 22:09:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2023-04-06 22:09:31] [INFO ] Invariant cache hit.
[2023-04-06 22:09:32] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 967/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1148 ms. Remains : 235/387 places, 967/1134 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s72 0))], 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 179 ms.
Stack based approach found an accepted trace after 495 steps with 0 reset with depth 496 and stack size 414 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-03 finished in 1388 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)||G(p1)))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 242 place count 265 transition count 1002
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 265 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 972
Applied a total of 304 rules in 55 ms. Remains 235 /387 variables (removed 152) and now considering 972/1134 (removed 162) transitions.
[2023-04-06 22:09:32] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
// Phase 1: matrix 378 rows 235 cols
[2023-04-06 22:09:32] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:09:32] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-06 22:09:32] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2023-04-06 22:09:32] [INFO ] Invariant cache hit.
[2023-04-06 22:09:32] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:09:33] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-04-06 22:09:33] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:09:33] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2023-04-06 22:09:33] [INFO ] Invariant cache hit.
[2023-04-06 22:09:33] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 972/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1093 ms. Remains : 235/387 places, 972/1134 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s186 1)), p1:(AND (EQ s2 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 1357 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' '!(((!p0 U ((p2 U p3)&&p1))||G(p4)))'
Support contains 10 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 387 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 382 transition count 1129
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 10 place count 382 transition count 1018
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 232 place count 271 transition count 1018
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 234 place count 269 transition count 1006
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 269 transition count 1006
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 294 place count 240 transition count 977
Applied a total of 294 rules in 48 ms. Remains 240 /387 variables (removed 147) and now considering 977/1134 (removed 157) transitions.
[2023-04-06 22:09:33] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
// Phase 1: matrix 383 rows 240 cols
[2023-04-06 22:09:33] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:09:33] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-04-06 22:09:33] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
[2023-04-06 22:09:33] [INFO ] Invariant cache hit.
[2023-04-06 22:09:34] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:09:34] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-04-06 22:09:34] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 22:09:34] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
[2023-04-06 22:09:34] [INFO ] Invariant cache hit.
[2023-04-06 22:09:34] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/387 places, 977/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1125 ms. Remains : 240/387 places, 977/1134 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, (OR (NOT p1) (NOT p3)), (NOT p4), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=1 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 7}], [{ cond=(NOT p4), acceptance={} source=2 dest: 0}, { cond=p4, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p4)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 p4), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p4), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 p0 p4), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p4)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) p0 (NOT p4)) (AND (NOT p3) (NOT p2) p0 (NOT p4))), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p2) (NOT p0) (NOT p4))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p3) (NOT p2) p0 p4)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0) p4), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p3) (NOT p2) (NOT p0) p4)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3) p2 p0 p4), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0 (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p4), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2 p4), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p1:(AND (NOT (AND (EQ s5 1) (EQ s22 1) (EQ s174 1))) (EQ s9 1) (EQ s73 1)), p0:(AND (EQ s20 1) (EQ s112 1)), p3:(AND (EQ s9 1) (EQ s73 1)), p2:(AND (EQ s0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 351 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 1477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 12 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:09:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:09:35] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:09:35] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-06 22:09:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:35] [INFO ] Invariant cache hit.
[2023-04-06 22:09:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:36] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2023-04-06 22:09:36] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:36] [INFO ] Invariant cache hit.
[2023-04-06 22:09:36] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1692 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-07 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:(NEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 321 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-07 finished in 1795 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(X(G((F(G(p0)) U p1))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 385 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 385 transition count 1122
Applied a total of 4 rules in 12 ms. Remains 385 /387 variables (removed 2) and now considering 1122/1134 (removed 12) transitions.
[2023-04-06 22:09:37] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2023-04-06 22:09:37] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 22:09:37] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-04-06 22:09:37] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2023-04-06 22:09:37] [INFO ] Invariant cache hit.
[2023-04-06 22:09:37] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:09:38] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2023-04-06 22:09:38] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2023-04-06 22:09:38] [INFO ] Invariant cache hit.
[2023-04-06 22:09:38] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 385/387 places, 1122/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1503 ms. Remains : 385/387 places, 1122/1134 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s14 1) (EQ s260 1)), p0:(AND (EQ s1 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 1922 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||G(p1)))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 15 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:09:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:09:38] [INFO ] Computed 19 invariants in 11 ms
[2023-04-06 22:09:39] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-06 22:09:39] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:39] [INFO ] Invariant cache hit.
[2023-04-06 22:09:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:40] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2023-04-06 22:09:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:40] [INFO ] Invariant cache hit.
[2023-04-06 22:09:40] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1604 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s203 0)), p0:(AND (EQ s23 1) (EQ s305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 220 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:09:41] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:41] [INFO ] Invariant cache hit.
[2023-04-06 22:09:41] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:09:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 22:09:41] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:09:41] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:41] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:41] [INFO ] After 73ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:41] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 407 ms
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 22:09:42] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 22:09:42] [INFO ] After 856ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 37 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 236/384 places, 968/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 898681 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898681 steps, saw 210195 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:45] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:09:45] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:09:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:45] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 22:09:45] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:45] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:45] [INFO ] After 33ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:45] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:09:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:09:45] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:09:45] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:09:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 22:09:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 355 ms
[2023-04-06 22:09:46] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-06 22:09:46] [INFO ] After 536ms 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 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:09:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:46] [INFO ] Invariant cache hit.
[2023-04-06 22:09:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-04-06 22:09:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:46] [INFO ] Invariant cache hit.
[2023-04-06 22:09:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:46] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-04-06 22:09:46] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 22:09:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:46] [INFO ] Invariant cache hit.
[2023-04-06 22:09:47] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1112 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 17 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 22:09:47] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:09:47] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:47] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:09:47] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:47] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-06 22:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-06 22:09:47] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 22:09:47] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 42 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
[2023-04-06 22:09:47] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:09:47] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 22:09:47] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-04-06 22:09:47] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:47] [INFO ] Invariant cache hit.
[2023-04-06 22:09:48] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:48] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-04-06 22:09:48] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 22:09:48] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:48] [INFO ] Invariant cache hit.
[2023-04-06 22:09:48] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/384 places, 968/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1183 ms. Remains : 236/384 places, 968/1116 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 (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) 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 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 22:09:49] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:49] [INFO ] Invariant cache hit.
[2023-04-06 22:09:49] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:49] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:49] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:49] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:49] [INFO ] After 36ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 368 ms
[2023-04-06 22:09:49] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 22:09:49] [INFO ] After 581ms 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 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 897330 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 897330 steps, saw 209898 distinct states, run finished after 3002 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:52] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:52] [INFO ] Invariant cache hit.
[2023-04-06 22:09:52] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:53] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:53] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:53] [INFO ] After 30ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:53] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:09:53] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:09:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-04-06 22:09:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:09:53] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:09:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:09:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 379 ms
[2023-04-06 22:09:53] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 22:09:53] [INFO ] After 586ms 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 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:09:53] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:53] [INFO ] Invariant cache hit.
[2023-04-06 22:09:53] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-06 22:09:53] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:53] [INFO ] Invariant cache hit.
[2023-04-06 22:09:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:54] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2023-04-06 22:09:54] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:09:54] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:54] [INFO ] Invariant cache hit.
[2023-04-06 22:09:54] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1184 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 18 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 22:09:54] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:09:54] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 22:09:54] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:09:54] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:54] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2023-04-06 22:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 22:09:55] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 22:09:55] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:09:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:09:55] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:09:56] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-04-06 22:09:56] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:56] [INFO ] Invariant cache hit.
[2023-04-06 22:09:56] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:56] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-04-06 22:09:56] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:09:56] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:09:56] [INFO ] Invariant cache hit.
[2023-04-06 22:09:57] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1185 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 18173 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(X(F(p0)))))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 8 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:09:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:09:57] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 22:09:57] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-04-06 22:09:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:57] [INFO ] Invariant cache hit.
[2023-04-06 22:09:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:09:58] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2023-04-06 22:09:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:09:58] [INFO ] Invariant cache hit.
[2023-04-06 22:09:58] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1514 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s14 0) (EQ s256 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 288 ms.
Product exploration explored 100000 steps with 25000 reset in 294 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 754852 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 754852 steps, saw 369381 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:10:02] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:02] [INFO ] Invariant cache hit.
[2023-04-06 22:10:02] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 22:10:02] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:03] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:03] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:03] [INFO ] After 45ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 0 ms to minimize.
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-04-06 22:10:03] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2023-04-06 22:10:04] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:10:04] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:10:04] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:10:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1126 ms
[2023-04-06 22:10:04] [INFO ] After 1196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 22:10:04] [INFO ] After 1460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 32 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 906129 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 906129 steps, saw 214880 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:10:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:10:07] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:10:07] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:07] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:07] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:07] [INFO ] After 35ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:07] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:10:07] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-06 22:10:07] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:10:07] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:10:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2023-04-06 22:10:07] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 22:10:07] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:10:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:07] [INFO ] Invariant cache hit.
[2023-04-06 22:10:08] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-04-06 22:10:08] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:08] [INFO ] Invariant cache hit.
[2023-04-06 22:10:08] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:08] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-04-06 22:10:08] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 22:10:08] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:08] [INFO ] Invariant cache hit.
[2023-04-06 22:10:08] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 11 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 22:10:08] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:10:08] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:10:09] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:10:09] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:10:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2023-04-06 22:10:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-06 22:10:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 82 ms
[2023-04-06 22:10:09] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:10:09] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 22:10:09] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:10:09] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:10:09] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-04-06 22:10:09] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:09] [INFO ] Invariant cache hit.
[2023-04-06 22:10:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:10] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2023-04-06 22:10:10] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:10] [INFO ] Invariant cache hit.
[2023-04-06 22:10:10] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1471 ms. Remains : 384/384 places, 1116/1116 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 758478 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 758478 steps, saw 371383 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:10:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:14] [INFO ] Invariant cache hit.
[2023-04-06 22:10:14] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 22:10:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:14] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:14] [INFO ] After 46ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:14] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-04-06 22:10:14] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-04-06 22:10:14] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:10:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1107 ms
[2023-04-06 22:10:15] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-06 22:10:15] [INFO ] After 1457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 27 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 892031 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 892031 steps, saw 212159 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:10:18] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:10:18] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:10:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:18] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 22:10:19] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:19] [INFO ] After 38ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:19] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 22:10:19] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:10:19] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:10:19] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-06 22:10:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
[2023-04-06 22:10:19] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-06 22:10:19] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:10:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:19] [INFO ] Invariant cache hit.
[2023-04-06 22:10:19] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-04-06 22:10:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:19] [INFO ] Invariant cache hit.
[2023-04-06 22:10:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:20] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2023-04-06 22:10:20] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 22:10:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:20] [INFO ] Invariant cache hit.
[2023-04-06 22:10:20] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 10 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 22:10:20] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:10:20] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:10:20] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:10:20] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:20] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-06 22:10:20] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-06 22:10:20] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2023-04-06 22:10:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 55 ms
[2023-04-06 22:10:20] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 22:10:20] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 288 ms.
Product exploration explored 100000 steps with 25000 reset in 289 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 6 place count 384 transition count 1284
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 114 place count 384 transition count 1284
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 150 place count 384 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 378 transition count 1278
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 378 transition count 1278
Deduced a syphon composed of 144 places in 1 ms
Applied a total of 162 rules in 79 ms. Remains 378 /384 variables (removed 6) and now considering 1278/1116 (removed -162) transitions.
[2023-04-06 22:10:22] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 22:10:22] [INFO ] Flow matrix only has 600 transitions (discarded 678 similar events)
// Phase 1: matrix 600 rows 378 cols
[2023-04-06 22:10:22] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 22:10:22] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 1278/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 378/384 places, 1278/1116 transitions.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 22:10:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:10:22] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:10:23] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-06 22:10:23] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:23] [INFO ] Invariant cache hit.
[2023-04-06 22:10:23] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:24] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2023-04-06 22:10:24] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:24] [INFO ] Invariant cache hit.
[2023-04-06 22:10:24] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1503 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 27352 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(X(F(p0)))))'
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 13 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:10:24] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:24] [INFO ] Invariant cache hit.
[2023-04-06 22:10:24] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-04-06 22:10:24] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:24] [INFO ] Invariant cache hit.
[2023-04-06 22:10:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:25] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2023-04-06 22:10:25] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:25] [INFO ] Invariant cache hit.
[2023-04-06 22:10:26] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1773 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s180 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 312 ms.
Product exploration explored 100000 steps with 25000 reset in 290 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 22:10:27] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:27] [INFO ] Invariant cache hit.
[2023-04-06 22:10:27] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-04-06 22:10:27] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:27] [INFO ] Invariant cache hit.
[2023-04-06 22:10:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:28] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2023-04-06 22:10:28] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:28] [INFO ] Invariant cache hit.
[2023-04-06 22:10:29] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 384/384 places, 1116/1116 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 278 ms.
Product exploration explored 100000 steps with 25000 reset in 287 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1116
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 5 place count 384 transition count 1284
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 113 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 148 place count 384 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 153 place count 379 transition count 1279
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 158 place count 379 transition count 1279
Deduced a syphon composed of 143 places in 1 ms
Applied a total of 158 rules in 47 ms. Remains 379 /384 variables (removed 5) and now considering 1279/1116 (removed -163) transitions.
[2023-04-06 22:10:30] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 22:10:30] [INFO ] Flow matrix only has 601 transitions (discarded 678 similar events)
// Phase 1: matrix 601 rows 379 cols
[2023-04-06 22:10:30] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:10:31] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/384 places, 1279/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 641 ms. Remains : 379/384 places, 1279/1116 transitions.
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 3 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 22:10:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 22:10:31] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:10:31] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-06 22:10:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:31] [INFO ] Invariant cache hit.
[2023-04-06 22:10:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:32] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-04-06 22:10:32] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:32] [INFO ] Invariant cache hit.
[2023-04-06 22:10:32] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1592 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 8467 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((G((p0||(F(p0)&&p1)))||(p2&&X(p3))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 13 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 22:10:32] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:32] [INFO ] Invariant cache hit.
[2023-04-06 22:10:33] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-06 22:10:33] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:33] [INFO ] Invariant cache hit.
[2023-04-06 22:10:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:34] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-04-06 22:10:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 22:10:34] [INFO ] Invariant cache hit.
[2023-04-06 22:10:34] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1738 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (NOT p0), (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=6 dest: 4}]], initial=0, aps=[p2:(EQ s132 1), p0:(AND (EQ s10 1) (EQ s319 1)), p1:(AND (EQ s10 1) (EQ s319 1)), p3:(AND (EQ s21 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-15 finished in 2086 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)||G(p1)||(X(X(p0))&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 264 transition count 996
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 306 place count 234 transition count 966
Applied a total of 306 rules in 57 ms. Remains 234 /387 variables (removed 153) and now considering 966/1134 (removed 168) transitions.
[2023-04-06 22:10:35] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:10:35] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:10:35] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-06 22:10:35] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:35] [INFO ] Invariant cache hit.
[2023-04-06 22:10:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:36] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2023-04-06 22:10:36] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:36] [INFO ] Invariant cache hit.
[2023-04-06 22:10:36] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 234/387 places, 966/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1170 ms. Remains : 234/387 places, 966/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s165 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Product exploration explored 100000 steps with 0 reset in 225 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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 526505 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526505 steps, saw 135155 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:10:40] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:40] [INFO ] Invariant cache hit.
[2023-04-06 22:10:40] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:40] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:40] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:10:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:40] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:40] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:40] [INFO ] After 85ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:40] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2023-04-06 22:10:40] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 397 ms
[2023-04-06 22:10:41] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-04-06 22:10:41] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 22:10:41] [INFO ] After 793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-04-06 22:10:41] [INFO ] After 1060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 463512 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463512 steps, saw 124553 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:10:44] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:44] [INFO ] Invariant cache hit.
[2023-04-06 22:10:45] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:45] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:45] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:10:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 22:10:45] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:45] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:45] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:45] [INFO ] After 88ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 376 ms
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-04-06 22:10:46] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 22:10:46] [INFO ] After 771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-06 22:10:46] [INFO ] After 1030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:10:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:46] [INFO ] Invariant cache hit.
[2023-04-06 22:10:46] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-04-06 22:10:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:46] [INFO ] Invariant cache hit.
[2023-04-06 22:10:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:47] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-04-06 22:10:47] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-06 22:10:47] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:47] [INFO ] Invariant cache hit.
[2023-04-06 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1169 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 13 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 22:10:47] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:10:47] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:10:47] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:10:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 22:10:47] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:10:47] [INFO ] After 22ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:47] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:10:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-04-06 22:10:47] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-06 22:10:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-06 22:10:47] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 22:10:47] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:10:48] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:10:48] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:10:48] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-04-06 22:10:48] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:48] [INFO ] Invariant cache hit.
[2023-04-06 22:10:48] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:48] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-04-06 22:10:48] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:48] [INFO ] Invariant cache hit.
[2023-04-06 22:10:49] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1131 ms. Remains : 234/234 places, 966/966 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 (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 486451 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486451 steps, saw 129104 distinct states, run finished after 3005 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:10:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:52] [INFO ] Invariant cache hit.
[2023-04-06 22:10:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:52] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:52] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:10:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:52] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:53] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:53] [INFO ] After 88ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 389 ms
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-04-06 22:10:53] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 22:10:53] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-06 22:10:53] [INFO ] After 1050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 447447 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447447 steps, saw 121183 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:10:57] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:57] [INFO ] Invariant cache hit.
[2023-04-06 22:10:57] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:10:57] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:57] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:10:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 22:10:57] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:10:57] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:57] [INFO ] After 97ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:57] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-06 22:10:57] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 22:10:57] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:10:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 22:10:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:10:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 427 ms
[2023-04-06 22:10:58] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-04-06 22:10:58] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:10:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-04-06 22:10:58] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 22:10:58] [INFO ] After 857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-04-06 22:10:58] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:10:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:58] [INFO ] Invariant cache hit.
[2023-04-06 22:10:58] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-04-06 22:10:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:58] [INFO ] Invariant cache hit.
[2023-04-06 22:10:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:10:59] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2023-04-06 22:10:59] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 22:10:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:10:59] [INFO ] Invariant cache hit.
[2023-04-06 22:10:59] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1164 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 12 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 22:10:59] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:10:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:10:59] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:10:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 22:10:59] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:10:59] [INFO ] After 21ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 22:10:59] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-06 22:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 22:10:59] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 4 ms to minimize.
[2023-04-06 22:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 22:10:59] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 22:10:59] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 190 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 2 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:11:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:11:00] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:11:00] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-04-06 22:11:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:00] [INFO ] Invariant cache hit.
[2023-04-06 22:11:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:01] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-04-06 22:11:01] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:01] [INFO ] Invariant cache hit.
[2023-04-06 22:11:01] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1134 ms. Remains : 234/234 places, 966/966 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 26875 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||G(p1)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-12
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 381 transition count 1016
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 269 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 239 place count 266 transition count 998
Iterating global reduction 2 with 3 rules applied. Total rules applied 242 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 302 place count 236 transition count 968
Applied a total of 302 rules in 42 ms. Remains 236 /387 variables (removed 151) and now considering 968/1134 (removed 166) transitions.
[2023-04-06 22:11:02] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:11:02] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 22:11:02] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-04-06 22:11:02] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:02] [INFO ] Invariant cache hit.
[2023-04-06 22:11:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:02] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-04-06 22:11:02] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:02] [INFO ] Invariant cache hit.
[2023-04-06 22:11:03] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 236/387 places, 968/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1067 ms. Remains : 236/387 places, 968/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s108 0)), p0:(AND (EQ s23 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 210 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:11:04] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:04] [INFO ] Invariant cache hit.
[2023-04-06 22:11:04] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:11:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:11:04] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:04] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:11:04] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:04] [INFO ] After 50ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:11:04] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:11:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:11:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 22:11:04] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:11:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 260 ms
[2023-04-06 22:11:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 22:11:04] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-06 22:11:04] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 866390 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 866390 steps, saw 203696 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:07] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:07] [INFO ] Invariant cache hit.
[2023-04-06 22:11:07] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:11:07] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:07] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:07] [INFO ] After 34ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:07] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 22:11:08] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:11:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-06 22:11:08] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:11:08] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:11:08] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 22:11:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 384 ms
[2023-04-06 22:11:08] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 22:11:08] [INFO ] After 592ms 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 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 25 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:08] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:08] [INFO ] Invariant cache hit.
[2023-04-06 22:11:08] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-06 22:11:08] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:08] [INFO ] Invariant cache hit.
[2023-04-06 22:11:08] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:09] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-04-06 22:11:09] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-06 22:11:09] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:09] [INFO ] Invariant cache hit.
[2023-04-06 22:11:09] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1105 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 17 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 22:11:09] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:11:09] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 22:11:09] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:11:09] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-06 22:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-06 22:11:09] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:11:09] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 24 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:09] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:11:09] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:11:10] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-04-06 22:11:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:10] [INFO ] Invariant cache hit.
[2023-04-06 22:11:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:10] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-04-06 22:11:10] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-06 22:11:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:10] [INFO ] Invariant cache hit.
[2023-04-06 22:11:11] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1126 ms. Remains : 236/236 places, 968/968 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 (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) 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 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:11] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:11] [INFO ] Invariant cache hit.
[2023-04-06 22:11:11] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:11:11] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:11] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:11] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:11] [INFO ] After 34ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:11] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:11:11] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:11:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 22:11:11] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:11:12] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:11:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 22:11:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 394 ms
[2023-04-06 22:11:12] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-06 22:11:12] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 866747 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 866747 steps, saw 203793 distinct states, run finished after 3002 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:15] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:15] [INFO ] Invariant cache hit.
[2023-04-06 22:11:15] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 22:11:15] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:15] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:15] [INFO ] After 31ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:15] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 22:11:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:11:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 22:11:15] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:11:15] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:11:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 22:11:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 384 ms
[2023-04-06 22:11:15] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-06 22:11:15] [INFO ] After 574ms 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 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 21 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:15] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:15] [INFO ] Invariant cache hit.
[2023-04-06 22:11:16] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-04-06 22:11:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:16] [INFO ] Invariant cache hit.
[2023-04-06 22:11:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:16] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-04-06 22:11:16] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 22:11:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:16] [INFO ] Invariant cache hit.
[2023-04-06 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 13 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 22:11:16] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:11:16] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:11:17] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:11:17] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-06 22:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 22:11:17] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:11:17] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 202 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:17] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:11:17] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 22:11:18] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-04-06 22:11:18] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:18] [INFO ] Invariant cache hit.
[2023-04-06 22:11:18] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:18] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2023-04-06 22:11:18] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:11:18] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:18] [INFO ] Invariant cache hit.
[2023-04-06 22:11:19] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1064 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 17162 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(X(F(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-13
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 264 transition count 996
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 306 place count 234 transition count 966
Applied a total of 306 rules in 28 ms. Remains 234 /387 variables (removed 153) and now considering 966/1134 (removed 168) transitions.
[2023-04-06 22:11:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:11:19] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:11:19] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-04-06 22:11:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:19] [INFO ] Invariant cache hit.
[2023-04-06 22:11:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:20] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-04-06 22:11:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:20] [INFO ] Invariant cache hit.
[2023-04-06 22:11:20] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 234/387 places, 966/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1095 ms. Remains : 234/387 places, 966/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s14 0) (EQ s148 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Product exploration explored 100000 steps with 25000 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 905737 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 905737 steps, saw 214828 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:24] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:24] [INFO ] Invariant cache hit.
[2023-04-06 22:11:24] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:11:24] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:24] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:24] [INFO ] After 39ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:24] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-04-06 22:11:24] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-04-06 22:11:24] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-06 22:11:24] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:11:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2023-04-06 22:11:24] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-06 22:11:24] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 905695 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 905695 steps, saw 214825 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:27] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:27] [INFO ] Invariant cache hit.
[2023-04-06 22:11:27] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 22:11:27] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:28] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:28] [INFO ] After 40ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:28] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-04-06 22:11:28] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
[2023-04-06 22:11:28] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 22:11:28] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2023-04-06 22:11:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 363 ms
[2023-04-06 22:11:28] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-06 22:11:28] [INFO ] After 580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:11:28] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:28] [INFO ] Invariant cache hit.
[2023-04-06 22:11:28] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-04-06 22:11:28] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:28] [INFO ] Invariant cache hit.
[2023-04-06 22:11:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:29] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-04-06 22:11:29] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:11:29] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:29] [INFO ] Invariant cache hit.
[2023-04-06 22:11:29] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1231 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 13 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 22:11:29] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:11:29] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 22:11:29] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:11:29] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:29] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2023-04-06 22:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-06 22:11:29] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:11:29] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:11:30] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:11:30] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:11:30] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-04-06 22:11:30] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:30] [INFO ] Invariant cache hit.
[2023-04-06 22:11:30] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:31] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-04-06 22:11:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:31] [INFO ] Invariant cache hit.
[2023-04-06 22:11:31] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1261 ms. Remains : 234/234 places, 966/966 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 883148 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 883148 steps, saw 210930 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:34] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:34] [INFO ] Invariant cache hit.
[2023-04-06 22:11:34] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-04-06 22:11:34] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:34] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:34] [INFO ] After 35ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:35] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-04-06 22:11:35] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 3 ms to minimize.
[2023-04-06 22:11:35] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:11:35] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-04-06 22:11:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2023-04-06 22:11:35] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 22:11:35] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 892787 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 892787 steps, saw 212422 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:11:38] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:38] [INFO ] Invariant cache hit.
[2023-04-06 22:11:38] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:11:38] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:11:38] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:38] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:38] [INFO ] After 41ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-04-06 22:11:38] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-06 22:11:38] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 22:11:39] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:11:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 370 ms
[2023-04-06 22:11:39] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 22:11:39] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:11:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:39] [INFO ] Invariant cache hit.
[2023-04-06 22:11:39] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-06 22:11:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:39] [INFO ] Invariant cache hit.
[2023-04-06 22:11:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:39] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-04-06 22:11:39] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:11:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:39] [INFO ] Invariant cache hit.
[2023-04-06 22:11:40] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1173 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 9 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 22:11:40] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:11:40] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:11:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 22:11:40] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 22:11:40] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:11:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 22:11:40] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:11:40] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 257 ms.
Product exploration explored 100000 steps with 25000 reset in 256 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:11:41] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 22:11:41] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 22:11:41] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 22:11:42] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 234/234 places, 966/966 transitions.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 22:11:42] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:42] [INFO ] Invariant cache hit.
[2023-04-06 22:11:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-04-06 22:11:42] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:42] [INFO ] Invariant cache hit.
[2023-04-06 22:11:42] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:42] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-04-06 22:11:42] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 22:11:42] [INFO ] Invariant cache hit.
[2023-04-06 22:11:43] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 234/234 places, 966/966 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 24152 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(X(F(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-14
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 387 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 382 transition count 1129
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 382 transition count 1016
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 269 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 239 place count 266 transition count 998
Iterating global reduction 2 with 3 rules applied. Total rules applied 242 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 302 place count 236 transition count 968
Applied a total of 302 rules in 28 ms. Remains 236 /387 variables (removed 151) and now considering 968/1134 (removed 166) transitions.
[2023-04-06 22:11:43] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 22:11:43] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 22:11:43] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-04-06 22:11:43] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:43] [INFO ] Invariant cache hit.
[2023-04-06 22:11:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:44] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-04-06 22:11:44] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:44] [INFO ] Invariant cache hit.
[2023-04-06 22:11:44] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 236/387 places, 968/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1115 ms. Remains : 236/387 places, 968/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s108 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Product exploration explored 100000 steps with 25000 reset in 263 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:45] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:45] [INFO ] Invariant cache hit.
[2023-04-06 22:11:45] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-06 22:11:45] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:45] [INFO ] Invariant cache hit.
[2023-04-06 22:11:45] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:46] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-04-06 22:11:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:46] [INFO ] Invariant cache hit.
[2023-04-06 22:11:46] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 236/236 places, 968/968 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 264 ms.
Product exploration explored 100000 steps with 25000 reset in 274 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 24 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:48] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:11:48] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:48] [INFO ] Invariant cache hit.
[2023-04-06 22:11:48] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 236/236 places, 968/968 transitions.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 22:11:48] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:48] [INFO ] Invariant cache hit.
[2023-04-06 22:11:48] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-04-06 22:11:48] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:48] [INFO ] Invariant cache hit.
[2023-04-06 22:11:48] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 22:11:49] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-04-06 22:11:49] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 22:11:49] [INFO ] Invariant cache hit.
[2023-04-06 22:11:49] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1110 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 6516 ms.
[2023-04-06 22:11:49] [INFO ] Flatten gal took : 41 ms
[2023-04-06 22:11:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-06 22:11:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 387 places, 1134 transitions and 5328 arcs took 9 ms.
Total runtime 194390 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-06
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA EisenbergMcGuire-PT-06-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EisenbergMcGuire-PT-06-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EisenbergMcGuire-PT-06-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680819236466

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:524
lola: Created skeleton in 0.000000 secs.
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 # 10 (type EXCL) for 9 EisenbergMcGuire-PT-06-LTLFireability-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for EisenbergMcGuire-PT-06-LTLFireability-14
lola: result : true
lola: markings : 84
lola: fired transitions : 168
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 EisenbergMcGuire-PT-06-LTLFireability-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for EisenbergMcGuire-PT-06-LTLFireability-13
lola: result : true
lola: markings : 84
lola: fired transitions : 168
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 EisenbergMcGuire-PT-06-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for EisenbergMcGuire-PT-06-LTLFireability-12
lola: result : false
lola: markings : 31019
lola: fired transitions : 75020
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 EisenbergMcGuire-PT-06-LTLFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 2/32 EisenbergMcGuire-PT-06-LTLFireability-01 239166 m, 47833 m/sec, 1858211 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 4/32 EisenbergMcGuire-PT-06-LTLFireability-01 469517 m, 46070 m/sec, 3886198 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 5/32 EisenbergMcGuire-PT-06-LTLFireability-01 680475 m, 42191 m/sec, 5951024 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 6/32 EisenbergMcGuire-PT-06-LTLFireability-01 881901 m, 40285 m/sec, 7967895 t fired, .

Time elapsed: 20 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 8/32 EisenbergMcGuire-PT-06-LTLFireability-01 1109515 m, 45522 m/sec, 9970450 t fired, .

Time elapsed: 25 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 9/32 EisenbergMcGuire-PT-06-LTLFireability-01 1304473 m, 38991 m/sec, 12022207 t fired, .

Time elapsed: 30 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 10/32 EisenbergMcGuire-PT-06-LTLFireability-01 1494165 m, 37938 m/sec, 14057634 t fired, .

Time elapsed: 35 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 12/32 EisenbergMcGuire-PT-06-LTLFireability-01 1705457 m, 42258 m/sec, 16074821 t fired, .

Time elapsed: 40 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 13/32 EisenbergMcGuire-PT-06-LTLFireability-01 1903733 m, 39655 m/sec, 18131888 t fired, .

Time elapsed: 45 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 14/32 EisenbergMcGuire-PT-06-LTLFireability-01 2114618 m, 42177 m/sec, 20141639 t fired, .

Time elapsed: 50 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 16/32 EisenbergMcGuire-PT-06-LTLFireability-01 2322765 m, 41629 m/sec, 22181351 t fired, .

Time elapsed: 55 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 17/32 EisenbergMcGuire-PT-06-LTLFireability-01 2522767 m, 40000 m/sec, 24245056 t fired, .

Time elapsed: 60 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 18/32 EisenbergMcGuire-PT-06-LTLFireability-01 2730490 m, 41544 m/sec, 26260234 t fired, .

Time elapsed: 65 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 20/32 EisenbergMcGuire-PT-06-LTLFireability-01 2931027 m, 40107 m/sec, 28264297 t fired, .

Time elapsed: 70 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 21/32 EisenbergMcGuire-PT-06-LTLFireability-01 3145428 m, 42880 m/sec, 30268073 t fired, .

Time elapsed: 75 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 22/32 EisenbergMcGuire-PT-06-LTLFireability-01 3351023 m, 41119 m/sec, 32265107 t fired, .

Time elapsed: 80 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 23/32 EisenbergMcGuire-PT-06-LTLFireability-01 3541673 m, 38130 m/sec, 34279103 t fired, .

Time elapsed: 85 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3600 25/32 EisenbergMcGuire-PT-06-LTLFireability-01 3728869 m, 37439 m/sec, 36344883 t fired, .

Time elapsed: 90 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3600 26/32 EisenbergMcGuire-PT-06-LTLFireability-01 3932561 m, 40738 m/sec, 38337748 t fired, .

Time elapsed: 95 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3600 27/32 EisenbergMcGuire-PT-06-LTLFireability-01 4133945 m, 40276 m/sec, 40360813 t fired, .

Time elapsed: 100 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3600 29/32 EisenbergMcGuire-PT-06-LTLFireability-01 4337150 m, 40641 m/sec, 42352829 t fired, .

Time elapsed: 105 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3600 30/32 EisenbergMcGuire-PT-06-LTLFireability-01 4541440 m, 40858 m/sec, 44367924 t fired, .

Time elapsed: 110 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3600 31/32 EisenbergMcGuire-PT-06-LTLFireability-01 4731322 m, 37976 m/sec, 46394503 t fired, .

Time elapsed: 115 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3600 32/32 EisenbergMcGuire-PT-06-LTLFireability-01 4934534 m, 40642 m/sec, 48414514 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for EisenbergMcGuire-PT-06-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-LTLFireability-01: LTL unknown AGGR
EisenbergMcGuire-PT-06-LTLFireability-12: LTL false LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-13: LTL true LTL model checker
EisenbergMcGuire-PT-06-LTLFireability-14: LTL true LTL model checker


Time elapsed: 125 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-06"
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-06, 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-167987245000244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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