Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r166-smll-171636274400104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274400104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716478026459

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 15:27:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-23 15:27:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:27:08] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-23 15:27:08] [INFO ] Transformed 295 places.
[2024-05-23 15:27:08] [INFO ] Transformed 800 transitions.
[2024-05-23 15:27:08] [INFO ] Found NUPN structural information;
[2024-05-23 15:27:08] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 347 ms.
Built sparse matrix representations for Structural reductions in 16 ms.16098KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 295/295 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 98 ms. Remains 295 /295 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 121 ms. Remains : 295/295 places, 800/800 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 295/295 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 43 ms. Remains 295 /295 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-23 15:27:09] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2024-05-23 15:27:09] [INFO ] Computed 16 invariants in 23 ms
[2024-05-23 15:27:09] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-23 15:27:10] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2024-05-23 15:27:10] [INFO ] Invariant cache hit.
[2024-05-23 15:27:10] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-23 15:27:10] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2024-05-23 15:27:10] [INFO ] Redundant transitions in 66 ms returned []
Running 795 sub problems to find dead transitions.
[2024-05-23 15:27:10] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2024-05-23 15:27:10] [INFO ] Invariant cache hit.
[2024-05-23 15:27:10] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 295/295 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 11/306 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-23 15:27:18] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 23 ms to minimize.
[2024-05-23 15:27:18] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-23 15:27:18] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-23 15:27:19] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:27:19] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-05-23 15:27:19] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-05-23 15:27:19] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:27:20] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 4 ms to minimize.
[2024-05-23 15:27:20] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:27:20] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:27:20] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 3 ms to minimize.
[2024-05-23 15:27:21] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-05-23 15:27:21] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 3 ms to minimize.
[2024-05-23 15:27:21] [INFO ] Deduced a trap composed of 98 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:27:21] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:27:21] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 3 ms to minimize.
[2024-05-23 15:27:22] [INFO ] Deduced a trap composed of 71 places in 214 ms of which 4 ms to minimize.
[2024-05-23 15:27:22] [INFO ] Deduced a trap composed of 79 places in 246 ms of which 4 ms to minimize.
[2024-05-23 15:27:22] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 3 ms to minimize.
[2024-05-23 15:27:22] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-23 15:27:28] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-23 15:27:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-23 15:27:29] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:27:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 15:27:31] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 4 ms to minimize.
[2024-05-23 15:27:31] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 4 ms to minimize.
[2024-05-23 15:27:31] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 4 ms to minimize.
[2024-05-23 15:27:32] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 5 ms to minimize.
[2024-05-23 15:27:32] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 3 ms to minimize.
[2024-05-23 15:27:32] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 2 ms to minimize.
[2024-05-23 15:27:33] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 3 ms to minimize.
[2024-05-23 15:27:33] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-05-23 15:27:33] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 3 ms to minimize.
[2024-05-23 15:27:33] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 4 ms to minimize.
[2024-05-23 15:27:33] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 7 ms to minimize.
[2024-05-23 15:27:34] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 4 ms to minimize.
[2024-05-23 15:27:34] [INFO ] Deduced a trap composed of 60 places in 307 ms of which 6 ms to minimize.
[2024-05-23 15:27:34] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 5 ms to minimize.
[2024-05-23 15:27:35] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 4 ms to minimize.
[2024-05-23 15:27:35] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-23 15:27:36] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-23 15:27:36] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-23 15:27:36] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-23 15:27:37] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 3 ms to minimize.
[2024-05-23 15:27:37] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-23 15:27:37] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 3 ms to minimize.
[2024-05-23 15:27:37] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:27:37] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-23 15:27:37] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-05-23 15:27:38] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:27:38] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 4 ms to minimize.
[2024-05-23 15:27:38] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 4 ms to minimize.
[2024-05-23 15:27:38] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 15:27:40] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:27:40] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:27:40] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-23 15:27:40] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 3 ms to minimize.
[2024-05-23 15:27:41] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 4 ms to minimize.
[2024-05-23 15:27:41] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 2 ms to minimize.
SMT process timed out in 30770ms, After SMT, problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 30827ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 32156 ms. Remains : 295/295 places, 800/800 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1906 ms (no deadlock found). (steps per millisecond=655 )
Random directed walk for 1250001 steps, including 0 resets, run took 2032 ms (no deadlock found). (steps per millisecond=615 )
[2024-05-23 15:27:45] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2024-05-23 15:27:45] [INFO ] Invariant cache hit.
[2024-05-23 15:27:45] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-05-23 15:27:45] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 18 ms returned sat
[2024-05-23 15:27:46] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-05-23 15:27:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:27:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-23 15:27:46] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 14 ms returned sat
[2024-05-23 15:27:46] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-23 15:27:46] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-23 15:27:46] [INFO ] [Nat]Added 196 Read/Feed constraints in 41 ms returned sat
[2024-05-23 15:27:46] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:27:47] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 4 ms to minimize.
[2024-05-23 15:27:47] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-05-23 15:27:47] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 3 ms to minimize.
[2024-05-23 15:27:47] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 4 ms to minimize.
[2024-05-23 15:27:48] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 5 ms to minimize.
[2024-05-23 15:27:48] [INFO ] Deduced a trap composed of 55 places in 301 ms of which 4 ms to minimize.
[2024-05-23 15:27:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1731 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 190 transition count 695
Applied a total of 210 rules in 121 ms. Remains 190 /295 variables (removed 105) and now considering 695/800 (removed 105) transitions.
[2024-05-23 15:27:48] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
// Phase 1: matrix 360 rows 190 cols
[2024-05-23 15:27:48] [INFO ] Computed 16 invariants in 9 ms
[2024-05-23 15:27:49] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 15:27:49] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2024-05-23 15:27:49] [INFO ] Invariant cache hit.
[2024-05-23 15:27:49] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-23 15:27:49] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-05-23 15:27:49] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2024-05-23 15:27:49] [INFO ] Invariant cache hit.
[2024-05-23 15:27:50] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:27:54] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
[2024-05-23 15:27:55] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-05-23 15:27:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 15:27:55] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-23 15:27:56] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:27:57] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:27:57] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2024-05-23 15:27:57] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2024-05-23 15:27:57] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 3 ms to minimize.
[2024-05-23 15:27:57] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 2 ms to minimize.
[2024-05-23 15:27:58] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 2 ms to minimize.
[2024-05-23 15:27:58] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2024-05-23 15:27:58] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-05-23 15:27:58] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:28:03] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-23 15:28:03] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 3 ms to minimize.
[2024-05-23 15:28:03] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:28:03] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-23 15:28:03] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:28:03] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 3 ms to minimize.
[2024-05-23 15:28:04] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:28:04] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:28:04] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:28:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 15:28:04] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-05-23 15:28:04] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-23 15:28:05] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-05-23 15:28:05] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:28:05] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-23 15:28:05] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-05-23 15:28:06] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-23 15:28:06] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-05-23 15:28:06] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-23 15:28:06] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:28:07] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:28:08] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:28:08] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:28:08] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:28:08] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-23 15:28:08] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-23 15:28:08] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-05-23 15:28:09] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:28:10] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-23 15:28:10] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 2 ms to minimize.
[2024-05-23 15:28:10] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 3 ms to minimize.
[2024-05-23 15:28:10] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-23 15:28:10] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 2 ms to minimize.
[2024-05-23 15:28:11] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:28:12] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 2 ms to minimize.
[2024-05-23 15:28:12] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 2 ms to minimize.
[2024-05-23 15:28:12] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:28:13] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-23 15:28:13] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-23 15:28:13] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-23 15:28:13] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:28:13] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 4 ms to minimize.
[2024-05-23 15:28:14] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 2 ms to minimize.
[2024-05-23 15:28:14] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:28:14] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 5 ms to minimize.
[2024-05-23 15:28:14] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:28:14] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-05-23 15:28:14] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2024-05-23 15:28:15] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 3 ms to minimize.
[2024-05-23 15:28:15] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-05-23 15:28:15] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:28:15] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:28:16] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 2 ms to minimize.
[2024-05-23 15:28:16] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 286 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30051 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 80/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:28:24] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 3 ms to minimize.
[2024-05-23 15:28:24] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-23 15:28:25] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:28:25] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2024-05-23 15:28:25] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:28:25] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:28:26] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-05-23 15:28:26] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2024-05-23 15:28:27] [INFO ] Deduced a trap composed of 86 places in 201 ms of which 4 ms to minimize.
[2024-05-23 15:28:27] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
[2024-05-23 15:28:27] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:28:28] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:28:28] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 3 ms to minimize.
[2024-05-23 15:28:28] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-23 15:28:28] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 4 ms to minimize.
[2024-05-23 15:28:29] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 2 ms to minimize.
[2024-05-23 15:28:29] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2024-05-23 15:28:29] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-05-23 15:28:30] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2024-05-23 15:28:30] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:28:33] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 3 ms to minimize.
[2024-05-23 15:28:33] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 3 ms to minimize.
[2024-05-23 15:28:33] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 4 ms to minimize.
[2024-05-23 15:28:34] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2024-05-23 15:28:34] [INFO ] Deduced a trap composed of 54 places in 294 ms of which 3 ms to minimize.
[2024-05-23 15:28:34] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 4 ms to minimize.
[2024-05-23 15:28:34] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 3 ms to minimize.
[2024-05-23 15:28:35] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2024-05-23 15:28:35] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 4 ms to minimize.
[2024-05-23 15:28:35] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:28:35] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 3 ms to minimize.
[2024-05-23 15:28:36] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-05-23 15:28:36] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 4 ms to minimize.
[2024-05-23 15:28:37] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-05-23 15:28:38] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 3 ms to minimize.
[2024-05-23 15:28:40] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 3 ms to minimize.
[2024-05-23 15:28:40] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
[2024-05-23 15:28:41] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 3 ms to minimize.
[2024-05-23 15:28:41] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2024-05-23 15:28:41] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/326 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:28:46] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-05-23 15:28:47] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-05-23 15:28:47] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 4 ms to minimize.
[2024-05-23 15:28:48] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2024-05-23 15:28:49] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 331 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30037 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 125/125 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Starting structural reductions in LIVENESS mode, iteration 1 : 190/295 places, 695/800 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 61933 ms. Remains : 190/295 places, 695/800 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 3859 ms. (10 steps per ms) remains 479/690 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 34 ms. (11 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 30 ms. (13 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 479/479 properties
[2024-05-23 15:28:51] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2024-05-23 15:28:51] [INFO ] Invariant cache hit.
[2024-05-23 15:28:51] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/550 variables, and 134 constraints, problems are : Problem set: 0 solved, 479 unsolved in 5026 ms.
Refiners :[Domain max(s): 133/190 constraints, Positive P Invariants (semi-flows): 1/11 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 57/190 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 57/201 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-23 15:29:01] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 3 ms to minimize.
[2024-05-23 15:29:01] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-23 15:29:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 15:29:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 210 constraints, problems are : Problem set: 0 solved, 479 unsolved in 5020 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/479 constraints, Known Traps: 4/4 constraints]
After SMT, in 10270ms problems are : Problem set: 0 solved, 479 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 695/695 transitions.
Applied a total of 0 rules in 41 ms. Remains 190 /190 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 190/190 places, 695/695 transitions.
RANDOM walk for 3450928 steps (8 resets) in 120005 ms. (28 steps per ms) remains 463/479 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 463/463 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 463/463 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 463/463 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 462/463 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 460/462 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 459/460 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 455/459 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 454/455 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 452/454 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 451/452 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 450/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 449/450 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 448/449 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 448/448 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 448/448 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 447/448 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 447/447 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 446/447 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 446/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 445/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 445/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 444/445 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 444/444 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 444/444 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 444/444 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 441/444 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 440/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 439/440 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 438/439 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 438/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 437/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 435/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 435/435 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 428/435 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 428/428 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 428/428 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 422/428 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 422/422 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 422/422 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 415/422 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 415/415 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 415/415 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 410/415 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 410/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 409/410 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 406/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 406/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 405/406 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 405/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 404/405 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 404/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 402/404 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 402/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 400/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 399/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 394/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 393/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 392/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 391/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 391/391 properties
[2024-05-23 15:29:46] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2024-05-23 15:29:46] [INFO ] Invariant cache hit.
[2024-05-23 15:29:46] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 76/190 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 76/201 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:29:54] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 4 ms to minimize.
[2024-05-23 15:29:54] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 3 ms to minimize.
[2024-05-23 15:29:55] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-23 15:29:56] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2024-05-23 15:29:56] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:29:56] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 3 ms to minimize.
[2024-05-23 15:29:56] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 4 ms to minimize.
[2024-05-23 15:29:56] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-05-23 15:29:56] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 2 ms to minimize.
[2024-05-23 15:29:57] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 3 ms to minimize.
[2024-05-23 15:29:57] [INFO ] Deduced a trap composed of 53 places in 251 ms of which 3 ms to minimize.
[2024-05-23 15:29:57] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:29:58] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 4 ms to minimize.
[2024-05-23 15:29:58] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:01] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 4 ms to minimize.
[2024-05-23 15:30:02] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
[2024-05-23 15:30:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 15:30:02] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:30:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-23 15:30:02] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 3 ms to minimize.
[2024-05-23 15:30:02] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 2 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 2 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-23 15:30:03] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-23 15:30:04] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:30:04] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 4 ms to minimize.
[2024-05-23 15:30:04] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:30:04] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-23 15:30:04] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:06] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:30:06] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 3 ms to minimize.
[2024-05-23 15:30:06] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-05-23 15:30:06] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 4 ms to minimize.
[2024-05-23 15:30:07] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-05-23 15:30:07] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-05-23 15:30:07] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-05-23 15:30:08] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-05-23 15:30:08] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 2 ms to minimize.
[2024-05-23 15:30:08] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-23 15:30:09] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:30:09] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-23 15:30:09] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 3 ms to minimize.
[2024-05-23 15:30:10] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 3 ms to minimize.
[2024-05-23 15:30:10] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 15/261 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:12] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:30:12] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-23 15:30:12] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-05-23 15:30:13] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:30:13] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 15:30:13] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 5 ms to minimize.
[2024-05-23 15:30:13] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-23 15:30:14] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:30:14] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-23 15:30:14] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-23 15:30:14] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-23 15:30:14] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:30:15] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2024-05-23 15:30:15] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:30:15] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:30:15] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:30:16] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:30:16] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 2 ms to minimize.
[2024-05-23 15:30:16] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:30:16] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:19] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:30:19] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:30:19] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-23 15:30:19] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-23 15:30:20] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:30:21] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:30:21] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2024-05-23 15:30:21] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:30:21] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:30:21] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-23 15:30:22] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:30:22] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-23 15:30:22] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-05-23 15:30:22] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:23] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 1 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:30:24] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-23 15:30:25] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-23 15:30:25] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-23 15:30:25] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:30:25] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2024-05-23 15:30:25] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:25] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:30:26] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:30:26] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:30:26] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:30:26] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:30:26] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:27] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:30:28] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:30:28] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:30:28] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-23 15:30:28] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:28] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-05-23 15:30:28] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
[2024-05-23 15:30:29] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:30:29] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:29] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:30:29] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:30] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:30:30] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:30:31] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-23 15:30:31] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 336 constraints, problems are : Problem set: 0 solved, 391 unsolved in 45016 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 130/130 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 76/190 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 76/201 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 130/336 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:35] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:30:35] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:30:35] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-23 15:30:35] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:30:35] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-23 15:30:35] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:30:36] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:30:36] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-23 15:30:36] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:30:36] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-23 15:30:36] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:30:37] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:30:37] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:30:37] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-23 15:30:37] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-05-23 15:30:39] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 7 ms to minimize.
[2024-05-23 15:30:39] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-05-23 15:30:39] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 6 ms to minimize.
[2024-05-23 15:30:39] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2024-05-23 15:30:39] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:41] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:30:41] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 2 ms to minimize.
[2024-05-23 15:30:42] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:30:42] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:30:42] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:30:43] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-23 15:30:43] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:30:43] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-05-23 15:30:45] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
[2024-05-23 15:30:45] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:30:46] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 3 ms to minimize.
[2024-05-23 15:30:46] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-05-23 15:30:47] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:30:47] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 14/370 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:49] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2024-05-23 15:30:50] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 2 ms to minimize.
[2024-05-23 15:30:50] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 3 ms to minimize.
[2024-05-23 15:30:50] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-05-23 15:30:51] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2024-05-23 15:30:51] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:30:51] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 3 ms to minimize.
[2024-05-23 15:30:51] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
[2024-05-23 15:30:52] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:30:52] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 3 ms to minimize.
[2024-05-23 15:30:52] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-05-23 15:30:53] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-05-23 15:30:53] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:30:53] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:30:54] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 3 ms to minimize.
[2024-05-23 15:30:54] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:30:55] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 3 ms to minimize.
[2024-05-23 15:30:55] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 3 ms to minimize.
[2024-05-23 15:30:55] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 4 ms to minimize.
[2024-05-23 15:30:55] [INFO ] Deduced a trap composed of 55 places in 214 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:30:58] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2024-05-23 15:30:58] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-05-23 15:30:59] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 3 ms to minimize.
[2024-05-23 15:30:59] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-05-23 15:31:00] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 3 ms to minimize.
[2024-05-23 15:31:02] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-23 15:31:07] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 3 ms to minimize.
[2024-05-23 15:31:07] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 3 ms to minimize.
[2024-05-23 15:31:07] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:31:07] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-05-23 15:31:07] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:31:08] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-05-23 15:31:08] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:31:08] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 2 ms to minimize.
[2024-05-23 15:31:08] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2024-05-23 15:31:08] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 1 ms to minimize.
[2024-05-23 15:31:09] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-05-23 15:31:10] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:31:10] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 3 ms to minimize.
[2024-05-23 15:31:11] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:31:11] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:31:11] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
[2024-05-23 15:31:11] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 3 ms to minimize.
[2024-05-23 15:31:12] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
[2024-05-23 15:31:12] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-05-23 15:31:14] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 416 constraints, problems are : Problem set: 0 solved, 391 unsolved in 45018 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/391 constraints, Known Traps: 210/210 constraints]
After SMT, in 90205ms problems are : Problem set: 0 solved, 391 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 114 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 695/695 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 680
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 680
Applied a total of 6 rules in 43 ms. Remains 187 /190 variables (removed 3) and now considering 680/695 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 187/190 places, 680/695 transitions.
RANDOM walk for 3012664 steps (6 resets) in 118915 ms. (25 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 452 ms. (88 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 544 ms. (73 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 390/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 389/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 388/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 387/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 479 ms. (83 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 643 ms. (62 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 387/387 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 387/387 properties
Probabilistic random walk after 10000001 steps, saw 1755053 distinct states, run finished after 136563 ms. (steps per millisecond=73 ) properties seen :260
[2024-05-23 15:34:19] [INFO ] Flow matrix only has 345 transitions (discarded 335 similar events)
// Phase 1: matrix 345 rows 187 cols
[2024-05-23 15:34:19] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 15:34:19] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 132/187 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:21] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 4 ms to minimize.
[2024-05-23 15:34:21] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2024-05-23 15:34:22] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:34:22] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 4 ms to minimize.
[2024-05-23 15:34:22] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
[2024-05-23 15:34:22] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
[2024-05-23 15:34:22] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 3 ms to minimize.
[2024-05-23 15:34:23] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:34:24] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-23 15:34:24] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-23 15:34:24] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 2 ms to minimize.
[2024-05-23 15:34:24] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-23 15:34:25] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-23 15:34:25] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:25] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-23 15:34:26] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-05-23 15:34:26] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-23 15:34:27] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:34:27] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:27] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:30] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 3 ms to minimize.
[2024-05-23 15:34:30] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 3 ms to minimize.
[2024-05-23 15:34:31] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-05-23 15:34:31] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 3 ms to minimize.
[2024-05-23 15:34:31] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 345/532 variables, 187/234 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 184/418 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:39] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-05-23 15:34:39] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:34:40] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/532 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 14 (OVERLAPS) 0/532 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 421 constraints, problems are : Problem set: 0 solved, 127 unsolved in 29913 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 187/187 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 132/187 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:50] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:52] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:34:52] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:53] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 345/532 variables, 187/241 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 184/425 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 127/552 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:34:59] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:34:59] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:35:00] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-23 15:35:01] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/532 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:09] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:35:09] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-23 15:35:10] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:35:10] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-05-23 15:35:10] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/532 variables, 5/561 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:16] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-05-23 15:35:17] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-23 15:35:17] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:22] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:28] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:32] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:35:33] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-05-23 15:35:33] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2024-05-23 15:35:33] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:35:33] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:35:34] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-23 15:35:35] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:40] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-23 15:35:49] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/532 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 575 constraints, problems are : Problem set: 0 solved, 127 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 187/187 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 61/61 constraints]
After SMT, in 104999ms problems are : Problem set: 0 solved, 127 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 680/680 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 173 transition count 610
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 173 transition count 610
Applied a total of 28 rules in 50 ms. Remains 173 /187 variables (removed 14) and now considering 610/680 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 173/187 places, 610/680 transitions.
RANDOM walk for 4000000 steps (8 resets) in 71937 ms. (55 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 126/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 126/126 properties
Interrupted probabilistic random walk after 6944532 steps, run timeout after 84001 ms. (steps per millisecond=82 ) properties seen :18 out of 126
Probabilistic random walk after 6944532 steps, saw 1193192 distinct states, run finished after 84011 ms. (steps per millisecond=82 ) properties seen :18
[2024-05-23 15:37:57] [INFO ] Flow matrix only has 275 transitions (discarded 335 similar events)
// Phase 1: matrix 275 rows 173 cols
[2024-05-23 15:37:57] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 15:37:57] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 125/173 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:37:58] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:37:58] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-05-23 15:37:58] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-23 15:37:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:37:59] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-23 15:37:59] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-23 15:37:59] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-23 15:37:59] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
[2024-05-23 15:37:59] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 15:38:00] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-23 15:38:00] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-23 15:38:00] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-23 15:38:00] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2024-05-23 15:38:00] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 275/448 variables, 173/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 128/331 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/448 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 331 constraints, problems are : Problem set: 0 solved, 108 unsolved in 16152 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 125/173 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 275/448 variables, 173/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 128/331 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 108/439 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:38:17] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-05-23 15:38:17] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 2 ms to minimize.
[2024-05-23 15:38:17] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:38:22] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-05-23 15:38:22] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-23 15:38:23] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:38:24] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/448 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 446 constraints, problems are : Problem set: 0 solved, 108 unsolved in 25754 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 21/21 constraints]
After SMT, in 41962ms problems are : Problem set: 0 solved, 108 unsolved
Parikh walk visited 0 properties in 6761 ms.
Support contains 48 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 610/610 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 170 transition count 595
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 170 transition count 595
Applied a total of 6 rules in 26 ms. Remains 170 /173 variables (removed 3) and now considering 595/610 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 170/173 places, 595/610 transitions.
RANDOM walk for 4000000 steps (8 resets) in 66782 ms. (59 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 108/108 properties
Interrupted probabilistic random walk after 5151126 steps, run timeout after 60001 ms. (steps per millisecond=85 ) properties seen :0 out of 108
Probabilistic random walk after 5151126 steps, saw 882490 distinct states, run finished after 60001 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-23 15:40:06] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 15:40:06] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 15:40:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 122/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:08] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 3 ms to minimize.
[2024-05-23 15:40:08] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 3 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-23 15:40:09] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2024-05-23 15:40:10] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:40:10] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-23 15:40:10] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-23 15:40:10] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-23 15:40:11] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-05-23 15:40:11] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:14] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/430 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 319 constraints, problems are : Problem set: 0 solved, 108 unsolved in 16017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 122/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:24] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 260/430 variables, 170/204 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 116/320 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 108/428 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:32] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 2 ms to minimize.
[2024-05-23 15:40:33] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/430 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:35] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2024-05-23 15:40:36] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:40] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:40:41] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:45] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-23 15:40:52] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/430 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 436 constraints, problems are : Problem set: 0 solved, 108 unsolved in 44057 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 26/26 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 108 unsolved
Fused 108 Parikh solutions to 105 different solutions.
Parikh walk visited 3 properties in 4509 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 34 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 64105 ms. (62 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 105/105 properties
Interrupted probabilistic random walk after 5605404 steps, run timeout after 63001 ms. (steps per millisecond=88 ) properties seen :0 out of 105
Probabilistic random walk after 5605404 steps, saw 949935 distinct states, run finished after 63001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-23 15:42:36] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:42:36] [INFO ] Invariant cache hit.
[2024-05-23 15:42:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:42:37] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 3 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 3 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-23 15:42:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-05-23 15:42:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-23 15:42:39] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-23 15:42:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:42:39] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-23 15:42:39] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-23 15:42:40] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 2 ms to minimize.
[2024-05-23 15:42:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-23 15:42:40] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:42:52] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 260/430 variables, 170/203 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 116/319 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 105/424 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:42:59] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/430 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:43:03] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:43:03] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-23 15:43:03] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:43:03] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:43:07] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-05-23 15:43:07] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:43:10] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-23 15:43:11] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-05-23 15:43:12] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 3/434 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:43:15] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:43:16] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-23 15:43:16] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-23 15:43:21] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-23 15:43:21] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 439 constraints, problems are : Problem set: 0 solved, 105 unsolved in 38787 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 32/32 constraints]
After SMT, in 53900ms problems are : Problem set: 0 solved, 105 unsolved
Parikh walk visited 0 properties in 5826 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 15:43:35] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:43:35] [INFO ] Invariant cache hit.
[2024-05-23 15:43:36] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-23 15:43:36] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:43:36] [INFO ] Invariant cache hit.
[2024-05-23 15:43:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 15:43:36] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-23 15:43:36] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 15:43:36] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:43:36] [INFO ] Invariant cache hit.
[2024-05-23 15:43:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-23 15:43:40] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-23 15:43:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-23 15:43:42] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:43:42] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:43:42] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-23 15:43:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 15:43:43] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-23 15:43:43] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-23 15:43:43] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-23 15:43:43] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-23 15:43:43] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-23 15:43:43] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-23 15:43:44] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-05-23 15:43:45] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:43:45] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 15:43:45] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-23 15:43:45] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:43:48] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-23 15:43:48] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-23 15:43:50] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-23 15:43:51] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-23 15:43:51] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:43:51] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-23 15:43:51] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-05-23 15:43:51] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-23 15:43:51] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-23 15:43:52] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-23 15:43:52] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:43:55] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:43:55] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:43:55] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:43:56] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:44:01] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-23 15:44:02] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 2 ms to minimize.
[2024-05-23 15:44:02] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-05-23 15:44:02] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:44:02] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:44:02] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-23 15:44:03] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 94 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:44:10] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 2 ms to minimize.
[2024-05-23 15:44:10] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-05-23 15:44:12] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:44:16] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-05-23 15:44:16] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-23 15:44:16] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:44:16] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:44:21] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-05-23 15:44:21] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:44:21] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-05-23 15:44:21] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:44:21] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-23 15:44:22] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:44:23] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 3 ms to minimize.
[2024-05-23 15:44:24] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2024-05-23 15:44:24] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:44:28] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-23 15:44:28] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:44:34] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 3 ms to minimize.
[2024-05-23 15:44:34] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 3 ms to minimize.
[2024-05-23 15:44:34] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 115 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 99/99 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60876 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 400000 steps (8 resets) in 6066 ms. (65 steps per ms) remains 14/47 properties
Running SMT prover for 14 properties.
[2024-05-23 15:44:38] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:44:38] [INFO ] Invariant cache hit.
[2024-05-23 15:44:38] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-23 15:44:38] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-23 15:44:38] [INFO ] After 173ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2024-05-23 15:44:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 15:44:38] [INFO ] After 87ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2024-05-23 15:44:39] [INFO ] After 628ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-23 15:44:39] [INFO ] After 925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-23 15:44:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-23 15:44:39] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-23 15:44:39] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-23 15:44:39] [INFO ] After 105ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 498 ms
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2024-05-23 15:44:40] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-23 15:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-23 15:44:41] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-23 15:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
TRAPS : Iteration 1
[2024-05-23 15:44:41] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-23 15:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
TRAPS : Iteration 2
[2024-05-23 15:44:42] [INFO ] After 2518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
[2024-05-23 15:44:42] [INFO ] After 2900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
RANDOM walk for 4000000 steps (8 resets) in 68129 ms. (58 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 105/105 properties
Interrupted probabilistic random walk after 6329904 steps, run timeout after 69001 ms. (steps per millisecond=91 ) properties seen :5 out of 105
Probabilistic random walk after 6329904 steps, saw 1070671 distinct states, run finished after 69002 ms. (steps per millisecond=91 ) properties seen :5
[2024-05-23 15:46:14] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:46:14] [INFO ] Invariant cache hit.
[2024-05-23 15:46:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 15:46:16] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 3 ms to minimize.
[2024-05-23 15:46:16] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2024-05-23 15:46:16] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 3 ms to minimize.
[2024-05-23 15:46:16] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:46:16] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-23 15:46:16] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-23 15:46:17] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-23 15:46:18] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 2 ms to minimize.
[2024-05-23 15:46:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-23 15:46:18] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 100 unsolved in 14392 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 15:46:30] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 260/430 variables, 170/203 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 116/319 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 419 constraints, problems are : Problem set: 0 solved, 100 unsolved in 13590 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 17/17 constraints]
After SMT, in 28043ms problems are : Problem set: 0 solved, 100 unsolved
Parikh walk visited 0 properties in 6608 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 64328 ms. (62 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 100/100 properties
Interrupted probabilistic random walk after 5205504 steps, run timeout after 60001 ms. (steps per millisecond=86 ) properties seen :0 out of 100
Probabilistic random walk after 5205504 steps, saw 891134 distinct states, run finished after 60001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-23 15:48:09] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:48:09] [INFO ] Invariant cache hit.
[2024-05-23 15:48:09] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 3 ms to minimize.
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 3 ms to minimize.
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 2 ms to minimize.
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 15:48:11] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-23 15:48:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 15:48:12] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-23 15:48:12] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-23 15:48:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-23 15:48:12] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-23 15:48:12] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-23 15:48:13] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 3 ms to minimize.
[2024-05-23 15:48:13] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-23 15:48:13] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 260/430 variables, 170/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 100 unsolved in 13662 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 123/170 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 15:48:25] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 260/430 variables, 170/203 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 116/319 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 419 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9622 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 17/17 constraints]
After SMT, in 23343ms problems are : Problem set: 0 solved, 100 unsolved
Parikh walk visited 0 properties in 5363 ms.
Support contains 47 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 15:48:38] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:48:38] [INFO ] Invariant cache hit.
[2024-05-23 15:48:38] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 15:48:38] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:48:38] [INFO ] Invariant cache hit.
[2024-05-23 15:48:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 15:48:39] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2024-05-23 15:48:39] [INFO ] Redundant transitions in 8 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 15:48:39] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:48:39] [INFO ] Invariant cache hit.
[2024-05-23 15:48:39] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:48:44] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-05-23 15:48:44] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-23 15:48:44] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-23 15:48:44] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-05-23 15:48:44] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:48:44] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:48:45] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 2 ms to minimize.
[2024-05-23 15:48:45] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-23 15:48:45] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:48:45] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-05-23 15:48:45] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 2 ms to minimize.
[2024-05-23 15:48:45] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-05-23 15:48:46] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:48:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 15:48:46] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:48:46] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
[2024-05-23 15:48:46] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:48:47] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:48:47] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-05-23 15:48:47] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:48:48] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2024-05-23 15:48:48] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 15:48:48] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:48:49] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-05-23 15:48:49] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-23 15:48:49] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:48:49] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 3 ms to minimize.
[2024-05-23 15:48:50] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-23 15:48:50] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
[2024-05-23 15:48:50] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:48:51] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:48:51] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:48:51] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-23 15:48:51] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-05-23 15:48:51] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-05-23 15:48:51] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:48:52] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2024-05-23 15:48:52] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-23 15:48:52] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-23 15:48:52] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:48:57] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-05-23 15:48:57] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-23 15:48:59] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 2 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-23 15:49:00] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-23 15:49:01] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-05-23 15:49:01] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2024-05-23 15:49:01] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:49:01] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:49:01] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 2 ms to minimize.
[2024-05-23 15:49:02] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 2 ms to minimize.
[2024-05-23 15:49:02] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-23 15:49:02] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-23 15:49:03] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-23 15:49:03] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:49:06] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:49:07] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 3 ms to minimize.
[2024-05-23 15:49:07] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-05-23 15:49:07] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:49:07] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-23 15:49:08] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:49:08] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:49:08] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:49:08] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 2 ms to minimize.
[2024-05-23 15:49:08] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2024-05-23 15:49:09] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 87 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:49:14] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:49:14] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-23 15:49:14] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-23 15:49:14] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-05-23 15:49:15] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 3 ms to minimize.
[2024-05-23 15:49:15] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:49:15] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-05-23 15:49:15] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:49:16] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:49:16] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-05-23 15:49:16] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 3 ms to minimize.
[2024-05-23 15:49:16] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 3 ms to minimize.
[2024-05-23 15:49:18] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:49:18] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-23 15:49:18] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:49:18] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-05-23 15:49:19] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:49:23] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-05-23 15:49:24] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:49:30] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 2 ms to minimize.
[2024-05-23 15:49:30] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-05-23 15:49:31] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 3 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-05-23 15:49:37] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-05-23 15:49:39] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 115 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 99/99 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61115 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 400000 steps (8 resets) in 4026 ms. (99 steps per ms) remains 13/47 properties
Running SMT prover for 13 properties.
[2024-05-23 15:49:41] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 15:49:41] [INFO ] Invariant cache hit.
[2024-05-23 15:49:41] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-23 15:49:41] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-23 15:49:41] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2024-05-23 15:49:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 15:49:41] [INFO ] After 80ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-23 15:49:42] [INFO ] After 467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-23 15:49:42] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-23 15:49:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-23 15:49:42] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-23 15:49:42] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-23 15:49:42] [INFO ] After 116ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-23 15:49:42] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-23 15:49:42] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-23 15:49:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2024-05-23 15:49:42] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-05-23 15:49:43] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:49:43] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 2 ms to minimize.
[2024-05-23 15:49:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2024-05-23 15:49:43] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:49:43] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:49:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2024-05-23 15:49:43] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 15:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-23 15:49:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-23 15:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 1
[2024-05-23 15:49:44] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-05-23 15:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
TRAPS : Iteration 2
[2024-05-23 15:49:44] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-05-23 15:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-23 15:49:45] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
TRAPS : Iteration 3
[2024-05-23 15:49:45] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-05-23 15:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-23 15:49:46] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-23 15:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
TRAPS : Iteration 4
[2024-05-23 15:49:46] [INFO ] After 4393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-23 15:49:46] [INFO ] After 4780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
RANDOM walk for 531 steps (0 resets) in 8 ms. (59 steps per ms) remains 0/1 properties
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23727 steps (6 resets) in 72 ms. (325 steps per ms) remains 0/1 properties
RANDOM walk for 622 steps (0 resets) in 5 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 1049 steps (0 resets) in 7 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 11 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 214 steps (0 resets) in 8 ms. (23 steps per ms) remains 0/1 properties
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17332 steps, run visited all 1 properties in 113 ms. (steps per millisecond=153 )
Probabilistic random walk after 17332 steps, saw 8436 distinct states, run finished after 120 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11422 steps, run visited all 1 properties in 77 ms. (steps per millisecond=148 )
Probabilistic random walk after 11422 steps, saw 6278 distinct states, run finished after 77 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 32790 steps (6 resets) in 102 ms. (318 steps per ms) remains 0/1 properties
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 364 steps (0 resets) in 5 ms. (60 steps per ms) remains 0/1 properties
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 511 steps (0 resets) in 5 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 815 steps (0 resets) in 7 ms. (101 steps per ms) remains 0/1 properties
RANDOM walk for 6762 steps (1 resets) in 24 ms. (270 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28246 steps, run visited all 1 properties in 179 ms. (steps per millisecond=157 )
Probabilistic random walk after 28246 steps, saw 11508 distinct states, run finished after 180 ms. (steps per millisecond=156 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8344 steps, run visited all 1 properties in 56 ms. (steps per millisecond=149 )
Probabilistic random walk after 8344 steps, saw 4781 distinct states, run finished after 57 ms. (steps per millisecond=146 ) properties seen :1
RANDOM walk for 293 steps (0 resets) in 4 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3304 steps, run visited all 1 properties in 24 ms. (steps per millisecond=137 )
Probabilistic random walk after 3304 steps, saw 2268 distinct states, run finished after 25 ms. (steps per millisecond=132 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30261 steps (6 resets) in 28 ms. (1043 steps per ms) remains 0/1 properties
RANDOM walk for 19704 steps (3 resets) in 55 ms. (351 steps per ms) remains 0/1 properties
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 1080 steps (0 resets) in 6 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1096 steps, run visited all 1 properties in 11 ms. (steps per millisecond=99 )
Probabilistic random walk after 1096 steps, saw 847 distinct states, run finished after 12 ms. (steps per millisecond=91 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44206 steps, run visited all 1 properties in 261 ms. (steps per millisecond=169 )
Probabilistic random walk after 44206 steps, saw 15198 distinct states, run finished after 268 ms. (steps per millisecond=164 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4876 steps, run visited all 1 properties in 33 ms. (steps per millisecond=147 )
Probabilistic random walk after 4876 steps, saw 3118 distinct states, run finished after 33 ms. (steps per millisecond=147 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7456 steps, run visited all 1 properties in 47 ms. (steps per millisecond=158 )
Probabilistic random walk after 7456 steps, saw 4364 distinct states, run finished after 48 ms. (steps per millisecond=155 ) properties seen :1
RANDOM walk for 29355 steps (6 resets) in 88 ms. (329 steps per ms) remains 0/1 properties
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 68 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46576 steps, run visited all 1 properties in 181 ms. (steps per millisecond=257 )
Probabilistic random walk after 46576 steps, saw 15890 distinct states, run finished after 181 ms. (steps per millisecond=257 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9652 steps, run visited all 1 properties in 40 ms. (steps per millisecond=241 )
Probabilistic random walk after 9652 steps, saw 5422 distinct states, run finished after 40 ms. (steps per millisecond=241 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5362 steps, run visited all 1 properties in 25 ms. (steps per millisecond=214 )
Probabilistic random walk after 5362 steps, saw 3402 distinct states, run finished after 25 ms. (steps per millisecond=214 ) properties seen :1
RANDOM walk for 24102 steps (4 resets) in 53 ms. (446 steps per ms) remains 0/1 properties
RANDOM walk for 219 steps (0 resets) in 5 ms. (36 steps per ms) remains 0/1 properties
RANDOM walk for 411 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/1 properties
RANDOM walk for 724 steps (0 resets) in 7 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 878 steps (0 resets) in 6 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 160 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
RANDOM walk for 412 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/1 properties
RANDOM walk for 698 steps (0 resets) in 6 ms. (99 steps per ms) remains 0/1 properties
RANDOM walk for 1061 steps (0 resets) in 6 ms. (151 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 224 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 4 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 150 transition count 185
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 135 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 135 transition count 174
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 58 place count 119 transition count 174
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 90 place count 103 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 98 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 98 transition count 231
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 98 transition count 215
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 134 place count 82 transition count 215
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 82 transition count 215
Applied a total of 139 rules in 36 ms. Remains 82 /170 variables (removed 88) and now considering 215/595 (removed 380) transitions.
Running SMT prover for 100 properties.
// Phase 1: matrix 215 rows 82 cols
[2024-05-23 15:49:49] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 15:49:49] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 15:49:51] [INFO ] After 2742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:100
[2024-05-23 15:49:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 15:49:53] [INFO ] After 1214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :100
TRAPS : Iteration 0
[2024-05-23 15:49:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 15:49:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 15:49:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2024-05-23 15:49:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 15:49:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 15:49:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2024-05-23 15:49:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 15:49:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2024-05-23 15:49:57] [INFO ] After 4568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :100
[2024-05-23 15:49:58] [INFO ] After 6534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :100
Over-approximation ignoring read arcs solved 0 properties in 9404 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :100 assertions to prove.
Starting structural reductions in LIVENESS mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 190 transition count 695
Applied a total of 210 rules in 27 ms. Remains 190 /295 variables (removed 105) and now considering 695/800 (removed 105) transitions.
[2024-05-23 15:49:58] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
// Phase 1: matrix 360 rows 190 cols
[2024-05-23 15:49:58] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 15:49:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-23 15:49:58] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2024-05-23 15:49:58] [INFO ] Invariant cache hit.
[2024-05-23 15:49:58] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-23 15:49:59] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-05-23 15:49:59] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2024-05-23 15:49:59] [INFO ] Invariant cache hit.
[2024-05-23 15:49:59] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:03] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:50:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-23 15:50:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 15:50:03] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-23 15:50:04] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-05-23 15:50:04] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:50:04] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:50:04] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-05-23 15:50:05] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-23 15:50:05] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:50:05] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:50:05] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:50:05] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2024-05-23 15:50:05] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:50:06] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-05-23 15:50:06] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 3 ms to minimize.
[2024-05-23 15:50:06] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:50:06] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:50:06] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-23 15:50:06] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:11] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-23 15:50:11] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:50:11] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-23 15:50:11] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:50:12] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:50:12] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:50:12] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-23 15:50:12] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:50:12] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-23 15:50:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-23 15:50:13] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-23 15:50:13] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-23 15:50:13] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-23 15:50:13] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:50:14] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-23 15:50:14] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:50:14] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:50:14] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-05-23 15:50:14] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:50:14] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:16] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 3 ms to minimize.
[2024-05-23 15:50:16] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:50:16] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2024-05-23 15:50:16] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:50:16] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:20] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:50:20] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 2 ms to minimize.
[2024-05-23 15:50:20] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 3 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:50:21] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-23 15:50:22] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-05-23 15:50:22] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:50:22] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:50:22] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:50:22] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-23 15:50:23] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-23 15:50:23] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 2 ms to minimize.
[2024-05-23 15:50:23] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-05-23 15:50:23] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:50:24] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 286 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30019 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 80/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 2 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 4 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 4 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 2 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 3 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 2 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-05-23 15:50:43] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-05-23 15:50:44] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-05-23 15:50:45] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:50:46] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 3 ms to minimize.
[2024-05-23 15:50:46] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 3 ms to minimize.
[2024-05-23 15:50:46] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-05-23 15:50:46] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/326 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-05-23 15:50:50] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 3 ms to minimize.
[2024-05-23 15:50:51] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 3 ms to minimize.
[2024-05-23 15:50:51] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 3 ms to minimize.
[2024-05-23 15:50:52] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
[2024-05-23 15:50:53] [INFO ] Deduced a trap composed of 68 places in 164 ms of which 3 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
[2024-05-23 15:50:56] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2024-05-23 15:50:56] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-05-23 15:50:56] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 3 ms to minimize.
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:50:58] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-05-23 15:50:59] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:50:59] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 345 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30021 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 139/139 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LIVENESS mode, iteration 1 : 190/295 places, 695/800 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 61430 ms. Remains : 190/295 places, 695/800 transitions.
Unable to solve all queries for examination Liveness. Remains :695 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 695 properties from file /home/mcc/execution/Liveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 1431365 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-05

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 295
TRANSITIONS: 800
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3600
NUPN UNITS: 13
LOADING TIME: 1.048

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.064
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.56
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3576
MODEL NAME: /home/mcc/execution/model
295 places, 800 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-05, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-171636274400104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;