About the Execution of LoLa+red for FunctionPointer-PT-b032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 631.655 | 49644.00 | 86850.00 | 452.90 | TFFFFFTFFTFTFFFF | normal |
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.r167-tall-167838853500691.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 FunctionPointer-PT-b032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500691
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 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 FunctionPointer-PT-b032-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678505514978
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:31:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:31:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:31:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 03:31:56] [INFO ] Transformed 306 places.
[2023-03-11 03:31:56] [INFO ] Transformed 840 transitions.
[2023-03-11 03:31:56] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 36 place count 186 transition count 488
Iterating global reduction 1 with 27 rules applied. Total rules applied 63 place count 186 transition count 488
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 91 place count 186 transition count 460
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 173 transition count 434
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 173 transition count 434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 173 transition count 430
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 127 place count 167 transition count 418
Iterating global reduction 3 with 6 rules applied. Total rules applied 133 place count 167 transition count 418
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 163 transition count 402
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 163 transition count 402
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 159 transition count 394
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 159 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 157 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 157 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 156 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 156 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 155 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 155 transition count 380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 154 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 154 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 153 transition count 376
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 153 transition count 376
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 152 transition count 374
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 152 transition count 374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 151 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 151 transition count 372
Applied a total of 165 rules in 93 ms. Remains 151 /222 variables (removed 71) and now considering 372/648 (removed 276) transitions.
[2023-03-11 03:31:56] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
// Phase 1: matrix 256 rows 151 cols
[2023-03-11 03:31:56] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 03:31:57] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-11 03:31:57] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
[2023-03-11 03:31:57] [INFO ] Invariant cache hit.
[2023-03-11 03:31:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-11 03:31:57] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-11 03:31:57] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
[2023-03-11 03:31:57] [INFO ] Invariant cache hit.
[2023-03-11 03:31:57] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/222 places, 372/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 151/222 places, 372/648 transitions.
Support contains 14 out of 151 places after structural reductions.
[2023-03-11 03:31:57] [INFO ] Flatten gal took : 49 ms
[2023-03-11 03:31:57] [INFO ] Flatten gal took : 21 ms
[2023-03-11 03:31:57] [INFO ] Input system was already deterministic with 372 transitions.
Incomplete random walk after 10001 steps, including 6 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:31:58] [INFO ] Flow matrix only has 256 transitions (discarded 116 similar events)
[2023-03-11 03:31:58] [INFO ] Invariant cache hit.
[2023-03-11 03:31:58] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-11 03:31:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:31:58] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:31:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-11 03:31:58] [INFO ] After 28ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:31:58] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:31:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:31:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:31:58] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:31:58] [INFO ] After 23ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:31:58] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-11 03:31:58] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 605 edges and 151 vertex of which 126 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 126 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 119 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 119 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 119 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 113 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 113 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 108 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 108 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 103 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 103 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 98 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 98 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 94 transition count 238
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 94 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 91 transition count 232
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 91 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 88 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 88 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 87 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 87 transition count 224
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 135 place count 87 transition count 218
Applied a total of 135 rules in 76 ms. Remains 87 /151 variables (removed 64) and now considering 218/372 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 87/151 places, 218/372 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) 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
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
Interrupted probabilistic random walk after 669281 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 669281 steps, saw 416611 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:32:01] [INFO ] Flow matrix only has 136 transitions (discarded 82 similar events)
// Phase 1: matrix 136 rows 87 cols
[2023-03-11 03:32:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:32:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:01] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 03:32:01] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 03:32:01] [INFO ] After 18ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:01] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 03:32:01] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-11 03:32:01] [INFO ] Flow matrix only has 136 transitions (discarded 82 similar events)
[2023-03-11 03:32:01] [INFO ] Invariant cache hit.
[2023-03-11 03:32:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 03:32:02] [INFO ] Flow matrix only has 136 transitions (discarded 82 similar events)
[2023-03-11 03:32:02] [INFO ] Invariant cache hit.
[2023-03-11 03:32:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 03:32:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-11 03:32:02] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 03:32:02] [INFO ] Flow matrix only has 136 transitions (discarded 82 similar events)
[2023-03-11 03:32:02] [INFO ] Invariant cache hit.
[2023-03-11 03:32:02] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 87/87 places, 218/218 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 87 transition count 129
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 96 place count 80 transition count 129
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 96 place count 80 transition count 111
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 132 place count 62 transition count 111
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 162 place count 47 transition count 96
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 169 place count 40 transition count 82
Iterating global reduction 2 with 7 rules applied. Total rules applied 176 place count 40 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 183 place count 33 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 190 place count 33 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 197 place count 26 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 204 place count 26 transition count 54
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 211 place count 26 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 211 place count 26 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 25 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 24 transition count 46
Applied a total of 215 rules in 13 ms. Remains 24 /87 variables (removed 63) and now considering 46/218 (removed 172) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 46 rows 24 cols
[2023-03-11 03:32:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:32:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:02] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:32:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:32:02] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:02] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:02] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:02] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:02] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 03:32:02] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||G(((p2&&X(p3)) U X(p4)))))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 360
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 147 transition count 358
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 144 transition count 350
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 144 transition count 350
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 141 transition count 340
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 141 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 138 transition count 332
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 138 transition count 332
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 326
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 127 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 127 transition count 310
Applied a total of 50 rules in 25 ms. Remains 127 /151 variables (removed 24) and now considering 310/372 (removed 62) transitions.
[2023-03-11 03:32:02] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
// Phase 1: matrix 212 rows 127 cols
[2023-03-11 03:32:02] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:32:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 03:32:02] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:02] [INFO ] Invariant cache hit.
[2023-03-11 03:32:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-11 03:32:02] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-11 03:32:02] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:02] [INFO ] Invariant cache hit.
[2023-03-11 03:32:02] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/151 places, 310/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 127/151 places, 310/372 transitions.
Stuttering acceptance computed with spot in 582 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 10}], [{ cond=(NOT p4), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p4)), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p4)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p4)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1) p2 (NOT p4)), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) p3), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p4) p3), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p4)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 (NOT p1) p2 (NOT p4)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(GT 2 s54), p1:(LEQ 1 s111), p2:(LEQ s93 0), p4:(LEQ s99 s118), p3:(LEQ 2 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25048 reset in 323 ms.
Product exploration explored 100000 steps with 25029 reset in 253 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 683 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/127 stabilizing places and 64/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2 p4 (NOT p3)), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p4))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p4) p3)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4))))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1) p2))), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 1713 ms. Reduced automaton from 11 states, 33 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Incomplete random walk after 10003 steps, including 4 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-11 03:32:06] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:06] [INFO ] Invariant cache hit.
[2023-03-11 03:32:06] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-11 03:32:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:32:06] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-11 03:32:06] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-11 03:32:06] [INFO ] After 150ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-11 03:32:07] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-11 03:32:07] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 310/310 transitions.
Graph (complete) has 513 edges and 127 vertex of which 103 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 103 transition count 262
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 103 transition count 254
Applied a total of 57 rules in 16 ms. Remains 103 /127 variables (removed 24) and now considering 254/310 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 103/127 places, 254/310 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-11 03:32:07] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
// Phase 1: matrix 162 rows 103 cols
[2023-03-11 03:32:07] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:32:07] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-11 03:32:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:07] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-11 03:32:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:08] [INFO ] After 110ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-11 03:32:08] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-11 03:32:08] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 301369 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{0=1, 1=1, 2=1, 3=1, 6=1, 8=1, 9=1, 10=1, 12=1, 14=1, 16=1}
Probabilistic random walk after 301369 steps, saw 187606 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :11
Running SMT prover for 8 properties.
[2023-03-11 03:32:11] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:11] [INFO ] Invariant cache hit.
[2023-03-11 03:32:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:32:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:11] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 03:32:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:11] [INFO ] After 52ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 03:32:11] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 03:32:12] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) 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 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 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 :1
Running SMT prover for 3 properties.
[2023-03-11 03:32:12] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:12] [INFO ] Invariant cache hit.
[2023-03-11 03:32:12] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:32:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:12] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:32:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:12] [INFO ] After 20ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:32:12] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 03:32:12] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:32:12] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:12] [INFO ] Invariant cache hit.
[2023-03-11 03:32:12] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:12] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:12] [INFO ] After 14ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:12] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 03:32:12] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 671200 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 671200 steps, saw 417807 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:32:15] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:15] [INFO ] Invariant cache hit.
[2023-03-11 03:32:15] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:15] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:15] [INFO ] After 21ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:15] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 03:32:15] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-11 03:32:15] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:15] [INFO ] Invariant cache hit.
[2023-03-11 03:32:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 03:32:16] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:16] [INFO ] Invariant cache hit.
[2023-03-11 03:32:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:16] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-11 03:32:16] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 03:32:16] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:16] [INFO ] Invariant cache hit.
[2023-03-11 03:32:16] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 103/103 places, 254/254 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 103 transition count 154
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 108 place count 95 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 108 place count 95 transition count 132
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 152 place count 73 transition count 132
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 182 place count 58 transition count 117
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 188 place count 52 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 194 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 46 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 46 transition count 93
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 40 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 40 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 224 place count 40 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 36 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 36 transition count 76
Applied a total of 233 rules in 12 ms. Remains 36 /103 variables (removed 67) and now considering 76/254 (removed 178) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 76 rows 36 cols
[2023-03-11 03:32:16] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:32:16] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 03:32:16] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:32:16] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:16] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 03:32:16] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1) p2 p4 (NOT p3)), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p4))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p4) p3)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4))))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3))))), (X (X (AND p0 (NOT p1) p2))), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p4)), (F (AND p3 (NOT p2) (NOT p4))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2 (NOT p4))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) (NOT p4))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (AND (NOT p1) p2 p0 (NOT p4))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0 (NOT p4))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) p0 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0) (NOT p4))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p3) p0 (NOT p4))), (F (AND p3 p2 (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)))]
Knowledge based reduction with 30 factoid took 2184 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 310/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-11 03:32:19] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
// Phase 1: matrix 212 rows 127 cols
[2023-03-11 03:32:19] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 03:32:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 03:32:19] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:19] [INFO ] Invariant cache hit.
[2023-03-11 03:32:19] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-11 03:32:19] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-11 03:32:19] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:19] [INFO ] Invariant cache hit.
[2023-03-11 03:32:19] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 127/127 places, 310/310 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 683 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/127 stabilizing places and 64/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0 p4 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 p0)), (X (AND (NOT p1) p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1053 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 665 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Incomplete random walk after 10002 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-11 03:32:21] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:21] [INFO ] Invariant cache hit.
[2023-03-11 03:32:21] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-11 03:32:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:32:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:32:22] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-11 03:32:22] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-11 03:32:22] [INFO ] After 144ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-11 03:32:22] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-11 03:32:22] [INFO ] After 795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 310/310 transitions.
Graph (complete) has 513 edges and 127 vertex of which 103 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 103 transition count 262
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 103 transition count 254
Applied a total of 57 rules in 9 ms. Remains 103 /127 variables (removed 24) and now considering 254/310 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 103/127 places, 254/310 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 285591 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{0=1, 1=1, 2=1, 3=1, 6=1, 8=1, 9=1, 10=1, 12=1, 14=1, 16=1}
Probabilistic random walk after 285591 steps, saw 177785 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :11
Running SMT prover for 8 properties.
[2023-03-11 03:32:25] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
// Phase 1: matrix 162 rows 103 cols
[2023-03-11 03:32:25] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:32:25] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:32:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:25] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 03:32:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:26] [INFO ] After 60ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 03:32:26] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-11 03:32:26] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 53 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) 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 8) 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 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) 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 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-11 03:32:26] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:26] [INFO ] Invariant cache hit.
[2023-03-11 03:32:26] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:26] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:26] [INFO ] After 15ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:26] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 03:32:26] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 698380 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 698380 steps, saw 434723 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:32:29] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:29] [INFO ] Invariant cache hit.
[2023-03-11 03:32:29] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:29] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:29] [INFO ] After 16ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:29] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 03:32:29] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 103/103 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 254/254 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-11 03:32:29] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:29] [INFO ] Invariant cache hit.
[2023-03-11 03:32:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 03:32:29] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:29] [INFO ] Invariant cache hit.
[2023-03-11 03:32:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:32:30] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-11 03:32:30] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 03:32:30] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
[2023-03-11 03:32:30] [INFO ] Invariant cache hit.
[2023-03-11 03:32:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 103/103 places, 254/254 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 103 transition count 154
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 108 place count 95 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 108 place count 95 transition count 132
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 152 place count 73 transition count 132
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 182 place count 58 transition count 117
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 188 place count 52 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 194 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 46 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 46 transition count 93
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 40 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 40 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 224 place count 40 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 36 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 36 transition count 76
Applied a total of 233 rules in 21 ms. Remains 36 /103 variables (removed 67) and now considering 76/254 (removed 178) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 76 rows 36 cols
[2023-03-11 03:32:30] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 03:32:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:32:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:32:30] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:32:30] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:32:30] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 03:32:30] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2 p0 p4 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) p2 p0)), (X (AND (NOT p1) p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2 (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p4)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2 (NOT p4))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) (NOT p4))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (AND (NOT p1) p3 p2 (NOT p0) (NOT p4))), (F (AND (NOT p1) p2 p0 (NOT p4))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0 (NOT p4))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) p0 (NOT p4))), (F p1), (F (AND (NOT p1) (NOT p0) (NOT p4))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p3) p0 (NOT p4))), (F (AND p3 p2 (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)))]
Knowledge based reduction with 21 factoid took 1639 ms. Reduced automaton from 11 states, 32 edges and 5 AP (stutter sensitive) to 11 states, 32 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Product exploration explored 100000 steps with 25030 reset in 229 ms.
Product exploration explored 100000 steps with 24978 reset in 218 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 310/310 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 127 transition count 304
Applied a total of 6 rules in 36 ms. Remains 127 /127 variables (removed 0) and now considering 304/310 (removed 6) transitions.
[2023-03-11 03:32:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
// Phase 1: matrix 209 rows 127 cols
[2023-03-11 03:32:34] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:32:34] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/127 places, 304/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 127/127 places, 304/310 transitions.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 310/310 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
// Phase 1: matrix 212 rows 127 cols
[2023-03-11 03:32:34] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:32:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:34] [INFO ] Invariant cache hit.
[2023-03-11 03:32:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-11 03:32:34] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-11 03:32:34] [INFO ] Flow matrix only has 212 transitions (discarded 98 similar events)
[2023-03-11 03:32:34] [INFO ] Invariant cache hit.
[2023-03-11 03:32:34] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 127/127 places, 310/310 transitions.
Treatment of property FunctionPointer-PT-b032-LTLCardinality-03 finished in 32588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 150 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 145 transition count 358
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 145 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 356
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 141 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 141 transition count 346
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 138 transition count 336
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 138 transition count 336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 135 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 132 transition count 320
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 129 transition count 312
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 126 transition count 304
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 123 transition count 298
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 121 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 120 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 120 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 118 transition count 288
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 118 transition count 288
Applied a total of 67 rules in 18 ms. Remains 118 /151 variables (removed 33) and now considering 288/372 (removed 84) transitions.
[2023-03-11 03:32:35] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
// Phase 1: matrix 197 rows 118 cols
[2023-03-11 03:32:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 03:32:35] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:35] [INFO ] Invariant cache hit.
[2023-03-11 03:32:35] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:32:35] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-11 03:32:35] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:35] [INFO ] Invariant cache hit.
[2023-03-11 03:32:35] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/151 places, 288/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 118/151 places, 288/372 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LEQ 3 s95), p1:(LEQ s98 s91)], 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 157 ms.
Product exploration explored 100000 steps with 25000 reset in 160 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 535 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=267 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:36] [INFO ] Invariant cache hit.
[2023-03-11 03:32:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:36] [INFO ] Invariant cache hit.
[2023-03-11 03:32:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:32:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-11 03:32:36] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:36] [INFO ] Invariant cache hit.
[2023-03-11 03:32:36] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 118/118 places, 288/288 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2388 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=238 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 282
Applied a total of 6 rules in 16 ms. Remains 118 /118 variables (removed 0) and now considering 282/288 (removed 6) transitions.
[2023-03-11 03:32:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 194 transitions (discarded 88 similar events)
// Phase 1: matrix 194 rows 118 cols
[2023-03-11 03:32:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:38] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/118 places, 282/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 118/118 places, 282/288 transitions.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
// Phase 1: matrix 197 rows 118 cols
[2023-03-11 03:32:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:32:38] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 118/118 places, 288/288 transitions.
Treatment of property FunctionPointer-PT-b032-LTLCardinality-06 finished in 3549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 137 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 137 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 131 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 125 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 110 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 106 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 106 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 104 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 104 transition count 254
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 104 transition count 252
Applied a total of 97 rules in 29 ms. Remains 104 /151 variables (removed 47) and now considering 252/372 (removed 120) transitions.
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2023-03-11 03:32:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:38] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 03:32:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 03:32:38] [INFO ] Invariant cache hit.
[2023-03-11 03:32:38] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/151 places, 252/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 104/151 places, 252/372 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-07 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 144 transition count 354
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 144 transition count 354
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 138 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 138 transition count 338
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 132 transition count 318
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 126 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 55 place count 120 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 61 place count 120 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 67 place count 114 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 73 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 78 place count 109 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 83 place count 109 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 87 place count 105 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 91 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 94 place count 102 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 97 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 98 place count 101 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 100 place count 100 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 102 place count 99 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 99 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 105 place count 99 transition count 240
Applied a total of 105 rules in 37 ms. Remains 99 /151 variables (removed 52) and now considering 240/372 (removed 132) transitions.
[2023-03-11 03:32:38] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2023-03-11 03:32:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:32:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 03:32:39] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-11 03:32:39] [INFO ] Invariant cache hit.
[2023-03-11 03:32:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 03:32:39] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 03:32:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:39] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-11 03:32:39] [INFO ] Invariant cache hit.
[2023-03-11 03:32:39] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/151 places, 240/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 99/151 places, 240/372 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s91 s73)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-08 finished in 355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 144 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 144 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 144 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 139 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 139 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 134 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 134 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 124 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 106 transition count 260
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 106 transition count 256
Applied a total of 95 rules in 35 ms. Remains 106 /151 variables (removed 45) and now considering 256/372 (removed 116) transitions.
[2023-03-11 03:32:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-11 03:32:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:32:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 03:32:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2023-03-11 03:32:39] [INFO ] Invariant cache hit.
[2023-03-11 03:32:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:32:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-11 03:32:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2023-03-11 03:32:39] [INFO ] Invariant cache hit.
[2023-03-11 03:32:39] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 256/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 106/151 places, 256/372 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s100 s94)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 85 steps with 2 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-13 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||G(((p2&&X(p3)) U X(p4)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Found a Shortening insensitive property : FunctionPointer-PT-b032-LTLCardinality-06
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 151/151 places, 372/372 transitions.
Graph (complete) has 809 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 145 transition count 358
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 145 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 145 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 141 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 141 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 138 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 138 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 135 transition count 326
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 135 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 132 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 123 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 121 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 120 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 120 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 118 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 118 transition count 288
Applied a total of 67 rules in 32 ms. Remains 118 /151 variables (removed 33) and now considering 288/372 (removed 84) transitions.
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
// Phase 1: matrix 197 rows 118 cols
[2023-03-11 03:32:40] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:32:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:32:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-11 03:32:40] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:40] [INFO ] Invariant cache hit.
[2023-03-11 03:32:40] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 118/151 places, 288/372 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 356 ms. Remains : 118/151 places, 288/372 transitions.
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LEQ 3 s95), p1:(LEQ s98 s91)], 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 158 ms.
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10011 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 9210 steps, including 9 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1315 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:32:41] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-11 03:32:41] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:41] [INFO ] Invariant cache hit.
[2023-03-11 03:32:41] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 118/118 places, 288/288 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 2340 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1170 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 158 ms.
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 282
Applied a total of 6 rules in 12 ms. Remains 118 /118 variables (removed 0) and now considering 282/288 (removed 6) transitions.
[2023-03-11 03:32:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 194 transitions (discarded 88 similar events)
// Phase 1: matrix 194 rows 118 cols
[2023-03-11 03:32:43] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:32:43] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/118 places, 282/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 118/118 places, 282/288 transitions.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 288/288 transitions.
Applied a total of 0 rules in 0 ms. Remains 118 /118 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
// Phase 1: matrix 197 rows 118 cols
[2023-03-11 03:32:43] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 03:32:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:43] [INFO ] Invariant cache hit.
[2023-03-11 03:32:43] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:32:43] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-11 03:32:43] [INFO ] Flow matrix only has 197 transitions (discarded 91 similar events)
[2023-03-11 03:32:43] [INFO ] Invariant cache hit.
[2023-03-11 03:32:43] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 118/118 places, 288/288 transitions.
Treatment of property FunctionPointer-PT-b032-LTLCardinality-06 finished in 3835 ms.
[2023-03-11 03:32:43] [INFO ] Flatten gal took : 16 ms
[2023-03-11 03:32:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 03:32:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 372 transitions and 1502 arcs took 3 ms.
Total runtime 47283 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b032
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality
FORMULA FunctionPointer-PT-b032-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FunctionPointer-PT-b032-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678505564622
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-b032-LTLCardinality-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for FunctionPointer-PT-b032-LTLCardinality-06
lola: result : true
lola: markings : 23
lola: fired transitions : 34
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-b032-LTLCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for FunctionPointer-PT-b032-LTLCardinality-03
lola: result : false
lola: markings : 52
lola: fired transitions : 53
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b032-LTLCardinality-03: LTL false LTL model checker
FunctionPointer-PT-b032-LTLCardinality-06: LTL true LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="FunctionPointer-PT-b032"
export BK_EXAMINATION="LTLCardinality"
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 FunctionPointer-PT-b032, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853500691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b032.tgz
mv FunctionPointer-PT-b032 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;