About the Execution of GreatSPN+red for EisenbergMcGuire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3052.136 | 1800000.00 | 3233391.00 | 4023.30 | [undef] | Time out reached |
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-171636274400119.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-08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274400119
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 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 1.7M 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 1716485490951
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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 17:31:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-23 17:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:31:33] [INFO ] Load time of PNML (sax parser for PT used): 394 ms
[2024-05-23 17:31:33] [INFO ] Transformed 712 places.
[2024-05-23 17:31:33] [INFO ] Transformed 2816 transitions.
[2024-05-23 17:31:33] [INFO ] Found NUPN structural information;
[2024-05-23 17:31:33] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 604 ms.
Built sparse matrix representations for Structural reductions in 21 ms.28973KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 2816/2816 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 394 ms. Remains 712 /712 variables (removed 0) and now considering 2816/2816 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 429 ms. Remains : 712/712 places, 2816/2816 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 2816/2816 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 192 ms. Remains 712 /712 variables (removed 0) and now considering 2816/2816 (removed 0) transitions.
[2024-05-23 17:31:34] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2024-05-23 17:31:34] [INFO ] Computed 25 invariants in 42 ms
[2024-05-23 17:31:35] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-23 17:31:35] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-05-23 17:31:35] [INFO ] Invariant cache hit.
[2024-05-23 17:31:36] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-05-23 17:31:36] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-05-23 17:31:36] [INFO ] Redundant transitions in 209 ms returned []
Running 2808 sub problems to find dead transitions.
[2024-05-23 17:31:36] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-05-23 17:31:36] [INFO ] Invariant cache hit.
[2024-05-23 17:31:37] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 712/712 constraints. Problems are: Problem set: 0 solved, 2808 unsolved
SMT process timed out in 32603ms, After SMT, problems are : Problem set: 0 solved, 2808 unsolved
Search for dead transitions found 0 dead transitions in 32680ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 34882 ms. Remains : 712/712 places, 2816/2816 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3603 ms (no deadlock found). (steps per millisecond=346 )
Random directed walk for 1250001 steps, including 0 resets, run took 4883 ms (no deadlock found). (steps per millisecond=255 )
[2024-05-23 17:32:18] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-05-23 17:32:18] [INFO ] Invariant cache hit.
[2024-05-23 17:32:19] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned sat
[2024-05-23 17:32:19] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 136 ms returned sat
[2024-05-23 17:32:21] [INFO ] [Real]Absence check using state equation in 1986 ms returned sat
[2024-05-23 17:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:32:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2024-05-23 17:32:22] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 80 ms returned sat
[2024-05-23 17:32:23] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2024-05-23 17:32:23] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-05-23 17:32:24] [INFO ] [Nat]Added 676 Read/Feed constraints in 313 ms returned sat
[2024-05-23 17:32:25] [INFO ] Deduced a trap composed of 3 places in 795 ms of which 114 ms to minimize.
[2024-05-23 17:32:26] [INFO ] Deduced a trap composed of 3 places in 805 ms of which 13 ms to minimize.
[2024-05-23 17:32:27] [INFO ] Deduced a trap composed of 88 places in 993 ms of which 12 ms to minimize.
[2024-05-23 17:32:28] [INFO ] Deduced a trap composed of 36 places in 806 ms of which 7 ms to minimize.
[2024-05-23 17:32:29] [INFO ] Deduced a trap composed of 32 places in 857 ms of which 7 ms to minimize.
[2024-05-23 17:32:30] [INFO ] Deduced a trap composed of 58 places in 673 ms of which 7 ms to minimize.
[2024-05-23 17:32:30] [INFO ] Deduced a trap composed of 3 places in 755 ms of which 7 ms to minimize.
[2024-05-23 17:32:32] [INFO ] Deduced a trap composed of 3 places in 823 ms of which 7 ms to minimize.
[2024-05-23 17:32:33] [INFO ] Deduced a trap composed of 3 places in 905 ms of which 11 ms to minimize.
[2024-05-23 17:32:34] [INFO ] Deduced a trap composed of 3 places in 787 ms of which 7 ms to minimize.
[2024-05-23 17:32:35] [INFO ] Deduced a trap composed of 3 places in 777 ms of which 7 ms to minimize.
[2024-05-23 17:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 10751 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 704 transition count 2608
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 504 transition count 2608
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 448 transition count 2552
Applied a total of 528 rules in 199 ms. Remains 448 /712 variables (removed 264) and now considering 2552/2816 (removed 264) transitions.
[2024-05-23 17:32:35] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
// Phase 1: matrix 1104 rows 448 cols
[2024-05-23 17:32:35] [INFO ] Computed 25 invariants in 11 ms
[2024-05-23 17:32:36] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2024-05-23 17:32:36] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-05-23 17:32:36] [INFO ] Invariant cache hit.
[2024-05-23 17:32:37] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-05-23 17:32:42] [INFO ] Implicit Places using invariants and state equation in 5656 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2024-05-23 17:32:42] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-05-23 17:32:42] [INFO ] Invariant cache hit.
[2024-05-23 17:32:42] [INFO ] State equation strengthened by 676 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 448/448 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
SMT process timed out in 32269ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 32333ms
Starting structural reductions in LIVENESS mode, iteration 1 : 448/712 places, 2552/2816 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 39432 ms. Remains : 448/712 places, 2552/2816 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 12329 ms. (3 steps per ms) remains 2100/2544 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 51 ms. (2 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 33 ms. (3 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2100/2100 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2100/2100 properties
[2024-05-23 17:33:18] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-05-23 17:33:18] [INFO ] Invariant cache hit.
[2024-05-23 17:33:18] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 346/346 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
SMT process timed out in 6889ms, After SMT, problems are : Problem set: 0 solved, 2100 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 346 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2552/2552 transitions.
Applied a total of 0 rules in 251 ms. Remains 448 /448 variables (removed 0) and now considering 2552/2552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 448/448 places, 2552/2552 transitions.
RANDOM walk for 750377 steps (0 resets) in 120004 ms. (6 steps per ms) remains 2076/2100 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2076/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2076/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2076/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2076/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2076/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2076/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2073/2076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2072/2073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2071/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2069/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2067/2069 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2066/2067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2065/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2065/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2064/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2061/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2061/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2060/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2060/2060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2059/2060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2058/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2056/2058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2056/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2056/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2056/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2055/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2054/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2053/2054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2050/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2048/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2045/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2044/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2041/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2040/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2040/2040 properties
Probabilistic random walk after 1000001 steps, saw 657639 distinct states, run finished after 94746 ms. (steps per millisecond=10 ) properties seen :508
[2024-05-23 17:35:35] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-05-23 17:35:35] [INFO ] Invariant cache hit.
[2024-05-23 17:35:35] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 231/231 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
At refinement iteration 3 (OVERLAPS) 217/448 variables, 16/248 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
SMT process timed out in 46259ms, After SMT, problems are : Problem set: 0 solved, 1532 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 231 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2552/2552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 2480
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 2480
Applied a total of 18 rules in 238 ms. Remains 439 /448 variables (removed 9) and now considering 2480/2552 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 439/448 places, 2480/2552 transitions.
RANDOM walk for 1027885 steps (0 resets) in 120004 ms. (8 steps per ms) remains 1531/1532 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1531/1531 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1531/1531 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 84617 ms. (steps per millisecond=11 ) properties seen :25
[2024-05-23 17:38:17] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-05-23 17:38:17] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 17:38:17] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1506 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1506 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1506 unsolved
[2024-05-23 17:39:11] [INFO ] Deduced a trap composed of 32 places in 741 ms of which 7 ms to minimize.
[2024-05-23 17:39:12] [INFO ] Deduced a trap composed of 33 places in 747 ms of which 7 ms to minimize.
[2024-05-23 17:39:13] [INFO ] Deduced a trap composed of 105 places in 728 ms of which 7 ms to minimize.
[2024-05-23 17:39:13] [INFO ] Deduced a trap composed of 37 places in 678 ms of which 6 ms to minimize.
[2024-05-23 17:39:14] [INFO ] Deduced a trap composed of 3 places in 700 ms of which 7 ms to minimize.
[2024-05-23 17:39:15] [INFO ] Deduced a trap composed of 49 places in 507 ms of which 4 ms to minimize.
[2024-05-23 17:39:15] [INFO ] Deduced a trap composed of 22 places in 530 ms of which 6 ms to minimize.
[2024-05-23 17:39:16] [INFO ] Deduced a trap composed of 118 places in 669 ms of which 6 ms to minimize.
[2024-05-23 17:39:16] [INFO ] Deduced a trap composed of 97 places in 637 ms of which 7 ms to minimize.
[2024-05-23 17:39:17] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 2 ms to minimize.
[2024-05-23 17:39:17] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 3 ms to minimize.
[2024-05-23 17:39:17] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 4 ms to minimize.
[2024-05-23 17:39:17] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:39:18] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 4 ms to minimize.
[2024-05-23 17:39:18] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 4 ms to minimize.
[2024-05-23 17:39:20] [INFO ] Deduced a trap composed of 88 places in 630 ms of which 6 ms to minimize.
[2024-05-23 17:39:20] [INFO ] Deduced a trap composed of 97 places in 622 ms of which 6 ms to minimize.
[2024-05-23 17:39:21] [INFO ] Deduced a trap composed of 90 places in 612 ms of which 6 ms to minimize.
[2024-05-23 17:39:22] [INFO ] Deduced a trap composed of 29 places in 582 ms of which 5 ms to minimize.
[2024-05-23 17:39:22] [INFO ] Deduced a trap composed of 25 places in 594 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1506 unsolved
[2024-05-23 17:39:24] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 5 ms to minimize.
[2024-05-23 17:39:25] [INFO ] Deduced a trap composed of 60 places in 423 ms of which 4 ms to minimize.
[2024-05-23 17:39:25] [INFO ] Deduced a trap composed of 15 places in 478 ms of which 4 ms to minimize.
[2024-05-23 17:39:25] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 8 ms to minimize.
[2024-05-23 17:39:27] [INFO ] Deduced a trap composed of 83 places in 641 ms of which 7 ms to minimize.
[2024-05-23 17:39:27] [INFO ] Deduced a trap composed of 93 places in 711 ms of which 6 ms to minimize.
[2024-05-23 17:39:28] [INFO ] Deduced a trap composed of 112 places in 654 ms of which 6 ms to minimize.
[2024-05-23 17:39:29] [INFO ] Deduced a trap composed of 118 places in 647 ms of which 7 ms to minimize.
[2024-05-23 17:39:30] [INFO ] Deduced a trap composed of 89 places in 608 ms of which 8 ms to minimize.
[2024-05-23 17:39:30] [INFO ] Deduced a trap composed of 95 places in 613 ms of which 6 ms to minimize.
[2024-05-23 17:39:31] [INFO ] Deduced a trap composed of 112 places in 621 ms of which 6 ms to minimize.
[2024-05-23 17:39:32] [INFO ] Deduced a trap composed of 64 places in 685 ms of which 6 ms to minimize.
[2024-05-23 17:39:32] [INFO ] Deduced a trap composed of 102 places in 684 ms of which 7 ms to minimize.
[2024-05-23 17:39:33] [INFO ] Deduced a trap composed of 101 places in 665 ms of which 6 ms to minimize.
SMT process timed out in 76278ms, After SMT, problems are : Problem set: 0 solved, 1506 unsolved
Fused 1506 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 155 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 1042131 steps (0 resets) in 120004 ms. (8 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1506/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1505/1506 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1505/1505 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 89200 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-23 17:41:35] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:41:35] [INFO ] Invariant cache hit.
[2024-05-23 17:41:35] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:42:14] [INFO ] Deduced a trap composed of 32 places in 484 ms of which 5 ms to minimize.
[2024-05-23 17:42:15] [INFO ] Deduced a trap composed of 33 places in 478 ms of which 4 ms to minimize.
[2024-05-23 17:42:15] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 5 ms to minimize.
[2024-05-23 17:42:16] [INFO ] Deduced a trap composed of 34 places in 462 ms of which 5 ms to minimize.
[2024-05-23 17:42:16] [INFO ] Deduced a trap composed of 53 places in 475 ms of which 4 ms to minimize.
[2024-05-23 17:42:17] [INFO ] Deduced a trap composed of 29 places in 474 ms of which 5 ms to minimize.
[2024-05-23 17:42:17] [INFO ] Deduced a trap composed of 20 places in 491 ms of which 4 ms to minimize.
[2024-05-23 17:42:17] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 3 ms to minimize.
[2024-05-23 17:42:18] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 4 ms to minimize.
[2024-05-23 17:42:18] [INFO ] Deduced a trap composed of 88 places in 430 ms of which 4 ms to minimize.
[2024-05-23 17:42:19] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 11 ms to minimize.
[2024-05-23 17:42:19] [INFO ] Deduced a trap composed of 117 places in 470 ms of which 4 ms to minimize.
[2024-05-23 17:42:20] [INFO ] Deduced a trap composed of 102 places in 437 ms of which 4 ms to minimize.
[2024-05-23 17:42:20] [INFO ] Deduced a trap composed of 93 places in 432 ms of which 5 ms to minimize.
[2024-05-23 17:42:20] [INFO ] Deduced a trap composed of 108 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:42:21] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 3 ms to minimize.
[2024-05-23 17:42:21] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 3 ms to minimize.
[2024-05-23 17:42:22] [INFO ] Deduced a trap composed of 98 places in 458 ms of which 4 ms to minimize.
[2024-05-23 17:42:22] [INFO ] Deduced a trap composed of 94 places in 469 ms of which 5 ms to minimize.
[2024-05-23 17:42:23] [INFO ] Deduced a trap composed of 116 places in 469 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:42:24] [INFO ] Deduced a trap composed of 41 places in 485 ms of which 7 ms to minimize.
[2024-05-23 17:42:25] [INFO ] Deduced a trap composed of 46 places in 425 ms of which 4 ms to minimize.
[2024-05-23 17:42:25] [INFO ] Deduced a trap composed of 54 places in 414 ms of which 4 ms to minimize.
[2024-05-23 17:42:26] [INFO ] Deduced a trap composed of 39 places in 382 ms of which 4 ms to minimize.
[2024-05-23 17:42:26] [INFO ] Deduced a trap composed of 101 places in 477 ms of which 5 ms to minimize.
[2024-05-23 17:42:27] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 4 ms to minimize.
[2024-05-23 17:42:27] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 4 ms to minimize.
[2024-05-23 17:42:27] [INFO ] Deduced a trap composed of 19 places in 393 ms of which 4 ms to minimize.
[2024-05-23 17:42:28] [INFO ] Deduced a trap composed of 35 places in 440 ms of which 4 ms to minimize.
[2024-05-23 17:42:28] [INFO ] Deduced a trap composed of 86 places in 456 ms of which 4 ms to minimize.
[2024-05-23 17:42:28] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:42:29] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-05-23 17:42:29] [INFO ] Deduced a trap composed of 103 places in 436 ms of which 4 ms to minimize.
[2024-05-23 17:42:30] [INFO ] Deduced a trap composed of 96 places in 434 ms of which 5 ms to minimize.
[2024-05-23 17:42:30] [INFO ] Deduced a trap composed of 109 places in 432 ms of which 4 ms to minimize.
[2024-05-23 17:42:31] [INFO ] Deduced a trap composed of 88 places in 440 ms of which 5 ms to minimize.
[2024-05-23 17:42:31] [INFO ] Deduced a trap composed of 119 places in 407 ms of which 4 ms to minimize.
[2024-05-23 17:42:31] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 5 ms to minimize.
[2024-05-23 17:42:32] [INFO ] Deduced a trap composed of 101 places in 454 ms of which 5 ms to minimize.
[2024-05-23 17:42:32] [INFO ] Deduced a trap composed of 101 places in 462 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:42:34] [INFO ] Deduced a trap composed of 82 places in 340 ms of which 4 ms to minimize.
[2024-05-23 17:42:34] [INFO ] Deduced a trap composed of 117 places in 405 ms of which 4 ms to minimize.
[2024-05-23 17:42:35] [INFO ] Deduced a trap composed of 127 places in 429 ms of which 4 ms to minimize.
[2024-05-23 17:42:35] [INFO ] Deduced a trap composed of 83 places in 440 ms of which 4 ms to minimize.
[2024-05-23 17:42:36] [INFO ] Deduced a trap composed of 113 places in 420 ms of which 4 ms to minimize.
[2024-05-23 17:42:36] [INFO ] Deduced a trap composed of 107 places in 417 ms of which 5 ms to minimize.
[2024-05-23 17:42:37] [INFO ] Deduced a trap composed of 103 places in 425 ms of which 5 ms to minimize.
[2024-05-23 17:42:37] [INFO ] Deduced a trap composed of 74 places in 488 ms of which 4 ms to minimize.
[2024-05-23 17:42:38] [INFO ] Deduced a trap composed of 82 places in 442 ms of which 4 ms to minimize.
[2024-05-23 17:42:38] [INFO ] Deduced a trap composed of 100 places in 485 ms of which 4 ms to minimize.
[2024-05-23 17:42:39] [INFO ] Deduced a trap composed of 69 places in 461 ms of which 4 ms to minimize.
[2024-05-23 17:42:39] [INFO ] Deduced a trap composed of 91 places in 438 ms of which 5 ms to minimize.
[2024-05-23 17:42:40] [INFO ] Deduced a trap composed of 87 places in 423 ms of which 5 ms to minimize.
[2024-05-23 17:42:40] [INFO ] Deduced a trap composed of 3 places in 476 ms of which 4 ms to minimize.
[2024-05-23 17:42:41] [INFO ] Deduced a trap composed of 73 places in 498 ms of which 4 ms to minimize.
[2024-05-23 17:42:41] [INFO ] Deduced a trap composed of 25 places in 465 ms of which 4 ms to minimize.
[2024-05-23 17:42:42] [INFO ] Deduced a trap composed of 108 places in 455 ms of which 4 ms to minimize.
[2024-05-23 17:42:42] [INFO ] Deduced a trap composed of 84 places in 441 ms of which 4 ms to minimize.
[2024-05-23 17:42:42] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:42:42] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:42:59] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2024-05-23 17:42:59] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:43:00] [INFO ] Deduced a trap composed of 88 places in 418 ms of which 4 ms to minimize.
[2024-05-23 17:43:00] [INFO ] Deduced a trap composed of 119 places in 492 ms of which 4 ms to minimize.
[2024-05-23 17:43:01] [INFO ] Deduced a trap composed of 96 places in 422 ms of which 4 ms to minimize.
[2024-05-23 17:43:01] [INFO ] Deduced a trap composed of 91 places in 427 ms of which 4 ms to minimize.
[2024-05-23 17:43:02] [INFO ] Deduced a trap composed of 88 places in 431 ms of which 4 ms to minimize.
[2024-05-23 17:43:02] [INFO ] Deduced a trap composed of 107 places in 416 ms of which 4 ms to minimize.
[2024-05-23 17:43:03] [INFO ] Deduced a trap composed of 106 places in 416 ms of which 4 ms to minimize.
[2024-05-23 17:43:03] [INFO ] Deduced a trap composed of 91 places in 410 ms of which 4 ms to minimize.
[2024-05-23 17:43:04] [INFO ] Deduced a trap composed of 101 places in 483 ms of which 4 ms to minimize.
[2024-05-23 17:43:04] [INFO ] Deduced a trap composed of 122 places in 486 ms of which 4 ms to minimize.
[2024-05-23 17:43:04] [INFO ] Deduced a trap composed of 122 places in 457 ms of which 4 ms to minimize.
[2024-05-23 17:43:05] [INFO ] Deduced a trap composed of 91 places in 485 ms of which 4 ms to minimize.
[2024-05-23 17:43:05] [INFO ] Deduced a trap composed of 124 places in 475 ms of which 4 ms to minimize.
[2024-05-23 17:43:06] [INFO ] Deduced a trap composed of 111 places in 423 ms of which 4 ms to minimize.
[2024-05-23 17:43:06] [INFO ] Deduced a trap composed of 87 places in 460 ms of which 4 ms to minimize.
[2024-05-23 17:43:07] [INFO ] Deduced a trap composed of 135 places in 352 ms of which 4 ms to minimize.
SMT process timed out in 91492ms, After SMT, problems are : Problem set: 0 solved, 1505 unsolved
Fused 1505 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 93 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 675045 steps (0 resets) in 120004 ms. (5 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1505/1505 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 85490 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-23 17:45:04] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:45:04] [INFO ] Invariant cache hit.
[2024-05-23 17:45:04] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:45:45] [INFO ] Deduced a trap composed of 32 places in 588 ms of which 5 ms to minimize.
[2024-05-23 17:45:45] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 4 ms to minimize.
[2024-05-23 17:45:45] [INFO ] Deduced a trap composed of 23 places in 474 ms of which 5 ms to minimize.
[2024-05-23 17:45:46] [INFO ] Deduced a trap composed of 34 places in 485 ms of which 5 ms to minimize.
[2024-05-23 17:45:46] [INFO ] Deduced a trap composed of 53 places in 465 ms of which 4 ms to minimize.
[2024-05-23 17:45:47] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 4 ms to minimize.
[2024-05-23 17:45:47] [INFO ] Deduced a trap composed of 20 places in 491 ms of which 4 ms to minimize.
[2024-05-23 17:45:48] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 3 ms to minimize.
[2024-05-23 17:45:48] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 3 ms to minimize.
[2024-05-23 17:45:49] [INFO ] Deduced a trap composed of 88 places in 420 ms of which 4 ms to minimize.
[2024-05-23 17:45:49] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 5 ms to minimize.
[2024-05-23 17:45:50] [INFO ] Deduced a trap composed of 117 places in 475 ms of which 5 ms to minimize.
[2024-05-23 17:45:50] [INFO ] Deduced a trap composed of 102 places in 461 ms of which 5 ms to minimize.
[2024-05-23 17:45:51] [INFO ] Deduced a trap composed of 93 places in 422 ms of which 4 ms to minimize.
[2024-05-23 17:45:51] [INFO ] Deduced a trap composed of 108 places in 439 ms of which 4 ms to minimize.
[2024-05-23 17:45:51] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 3 ms to minimize.
[2024-05-23 17:45:52] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 3 ms to minimize.
[2024-05-23 17:45:52] [INFO ] Deduced a trap composed of 98 places in 483 ms of which 5 ms to minimize.
[2024-05-23 17:45:53] [INFO ] Deduced a trap composed of 94 places in 635 ms of which 5 ms to minimize.
[2024-05-23 17:45:53] [INFO ] Deduced a trap composed of 116 places in 463 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:45:56] [INFO ] Deduced a trap composed of 41 places in 508 ms of which 4 ms to minimize.
[2024-05-23 17:45:56] [INFO ] Deduced a trap composed of 46 places in 477 ms of which 4 ms to minimize.
[2024-05-23 17:45:57] [INFO ] Deduced a trap composed of 54 places in 396 ms of which 4 ms to minimize.
[2024-05-23 17:45:57] [INFO ] Deduced a trap composed of 39 places in 408 ms of which 4 ms to minimize.
[2024-05-23 17:45:57] [INFO ] Deduced a trap composed of 101 places in 465 ms of which 4 ms to minimize.
[2024-05-23 17:45:58] [INFO ] Deduced a trap composed of 20 places in 473 ms of which 4 ms to minimize.
[2024-05-23 17:45:58] [INFO ] Deduced a trap composed of 3 places in 473 ms of which 4 ms to minimize.
[2024-05-23 17:45:59] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 4 ms to minimize.
[2024-05-23 17:45:59] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 5 ms to minimize.
[2024-05-23 17:46:00] [INFO ] Deduced a trap composed of 86 places in 440 ms of which 5 ms to minimize.
[2024-05-23 17:46:00] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:46:00] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:46:01] [INFO ] Deduced a trap composed of 103 places in 422 ms of which 4 ms to minimize.
[2024-05-23 17:46:01] [INFO ] Deduced a trap composed of 96 places in 437 ms of which 4 ms to minimize.
[2024-05-23 17:46:02] [INFO ] Deduced a trap composed of 109 places in 427 ms of which 4 ms to minimize.
[2024-05-23 17:46:02] [INFO ] Deduced a trap composed of 88 places in 432 ms of which 4 ms to minimize.
[2024-05-23 17:46:02] [INFO ] Deduced a trap composed of 119 places in 388 ms of which 4 ms to minimize.
[2024-05-23 17:46:03] [INFO ] Deduced a trap composed of 125 places in 322 ms of which 4 ms to minimize.
[2024-05-23 17:46:03] [INFO ] Deduced a trap composed of 101 places in 435 ms of which 5 ms to minimize.
[2024-05-23 17:46:04] [INFO ] Deduced a trap composed of 101 places in 433 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:46:06] [INFO ] Deduced a trap composed of 82 places in 434 ms of which 5 ms to minimize.
[2024-05-23 17:46:06] [INFO ] Deduced a trap composed of 117 places in 413 ms of which 4 ms to minimize.
[2024-05-23 17:46:06] [INFO ] Deduced a trap composed of 127 places in 420 ms of which 4 ms to minimize.
[2024-05-23 17:46:07] [INFO ] Deduced a trap composed of 83 places in 424 ms of which 5 ms to minimize.
[2024-05-23 17:46:07] [INFO ] Deduced a trap composed of 113 places in 396 ms of which 4 ms to minimize.
[2024-05-23 17:46:08] [INFO ] Deduced a trap composed of 107 places in 343 ms of which 4 ms to minimize.
[2024-05-23 17:46:08] [INFO ] Deduced a trap composed of 103 places in 412 ms of which 4 ms to minimize.
[2024-05-23 17:46:09] [INFO ] Deduced a trap composed of 74 places in 479 ms of which 4 ms to minimize.
[2024-05-23 17:46:09] [INFO ] Deduced a trap composed of 82 places in 433 ms of which 4 ms to minimize.
[2024-05-23 17:46:10] [INFO ] Deduced a trap composed of 100 places in 464 ms of which 5 ms to minimize.
[2024-05-23 17:46:10] [INFO ] Deduced a trap composed of 69 places in 478 ms of which 5 ms to minimize.
[2024-05-23 17:46:11] [INFO ] Deduced a trap composed of 91 places in 398 ms of which 4 ms to minimize.
[2024-05-23 17:46:11] [INFO ] Deduced a trap composed of 87 places in 401 ms of which 4 ms to minimize.
[2024-05-23 17:46:12] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 4 ms to minimize.
[2024-05-23 17:46:12] [INFO ] Deduced a trap composed of 73 places in 499 ms of which 5 ms to minimize.
[2024-05-23 17:46:13] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 4 ms to minimize.
[2024-05-23 17:46:13] [INFO ] Deduced a trap composed of 108 places in 434 ms of which 4 ms to minimize.
[2024-05-23 17:46:13] [INFO ] Deduced a trap composed of 84 places in 442 ms of which 5 ms to minimize.
[2024-05-23 17:46:14] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:46:14] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:46:31] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 2 ms to minimize.
[2024-05-23 17:46:31] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-05-23 17:46:32] [INFO ] Deduced a trap composed of 88 places in 437 ms of which 4 ms to minimize.
[2024-05-23 17:46:32] [INFO ] Deduced a trap composed of 119 places in 472 ms of which 5 ms to minimize.
[2024-05-23 17:46:33] [INFO ] Deduced a trap composed of 96 places in 425 ms of which 5 ms to minimize.
[2024-05-23 17:46:33] [INFO ] Deduced a trap composed of 91 places in 418 ms of which 4 ms to minimize.
[2024-05-23 17:46:34] [INFO ] Deduced a trap composed of 88 places in 469 ms of which 4 ms to minimize.
[2024-05-23 17:46:34] [INFO ] Deduced a trap composed of 107 places in 424 ms of which 4 ms to minimize.
[2024-05-23 17:46:34] [INFO ] Deduced a trap composed of 106 places in 395 ms of which 4 ms to minimize.
[2024-05-23 17:46:35] [INFO ] Deduced a trap composed of 91 places in 385 ms of which 4 ms to minimize.
[2024-05-23 17:46:35] [INFO ] Deduced a trap composed of 101 places in 487 ms of which 5 ms to minimize.
[2024-05-23 17:46:36] [INFO ] Deduced a trap composed of 122 places in 461 ms of which 4 ms to minimize.
[2024-05-23 17:46:36] [INFO ] Deduced a trap composed of 122 places in 438 ms of which 4 ms to minimize.
[2024-05-23 17:46:37] [INFO ] Deduced a trap composed of 91 places in 457 ms of which 4 ms to minimize.
[2024-05-23 17:46:37] [INFO ] Deduced a trap composed of 124 places in 446 ms of which 4 ms to minimize.
[2024-05-23 17:46:38] [INFO ] Deduced a trap composed of 111 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:46:38] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 4 ms to minimize.
[2024-05-23 17:46:39] [INFO ] Deduced a trap composed of 135 places in 426 ms of which 4 ms to minimize.
[2024-05-23 17:46:39] [INFO ] Deduced a trap composed of 111 places in 441 ms of which 5 ms to minimize.
[2024-05-23 17:46:40] [INFO ] Deduced a trap composed of 109 places in 467 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:46:42] [INFO ] Deduced a trap composed of 93 places in 427 ms of which 4 ms to minimize.
[2024-05-23 17:46:42] [INFO ] Deduced a trap composed of 25 places in 411 ms of which 4 ms to minimize.
[2024-05-23 17:46:43] [INFO ] Deduced a trap composed of 131 places in 460 ms of which 4 ms to minimize.
[2024-05-23 17:46:43] [INFO ] Deduced a trap composed of 93 places in 445 ms of which 4 ms to minimize.
[2024-05-23 17:46:43] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:46:44] [INFO ] Deduced a trap composed of 94 places in 471 ms of which 4 ms to minimize.
[2024-05-23 17:46:44] [INFO ] Deduced a trap composed of 79 places in 440 ms of which 4 ms to minimize.
[2024-05-23 17:46:45] [INFO ] Deduced a trap composed of 105 places in 434 ms of which 4 ms to minimize.
[2024-05-23 17:46:45] [INFO ] Deduced a trap composed of 136 places in 482 ms of which 5 ms to minimize.
[2024-05-23 17:46:46] [INFO ] Deduced a trap composed of 120 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:46:46] [INFO ] Deduced a trap composed of 131 places in 464 ms of which 4 ms to minimize.
[2024-05-23 17:46:47] [INFO ] Deduced a trap composed of 3 places in 463 ms of which 5 ms to minimize.
[2024-05-23 17:46:47] [INFO ] Deduced a trap composed of 104 places in 442 ms of which 4 ms to minimize.
[2024-05-23 17:46:48] [INFO ] Deduced a trap composed of 131 places in 386 ms of which 5 ms to minimize.
[2024-05-23 17:46:48] [INFO ] Deduced a trap composed of 108 places in 375 ms of which 4 ms to minimize.
[2024-05-23 17:46:48] [INFO ] Deduced a trap composed of 104 places in 473 ms of which 4 ms to minimize.
[2024-05-23 17:46:49] [INFO ] Deduced a trap composed of 3 places in 424 ms of which 4 ms to minimize.
[2024-05-23 17:46:49] [INFO ] Deduced a trap composed of 100 places in 423 ms of which 4 ms to minimize.
[2024-05-23 17:46:50] [INFO ] Deduced a trap composed of 136 places in 431 ms of which 4 ms to minimize.
[2024-05-23 17:46:50] [INFO ] Deduced a trap composed of 82 places in 457 ms of which 5 ms to minimize.
SMT process timed out in 106656ms, After SMT, problems are : Problem set: 0 solved, 1505 unsolved
Fused 1505 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 91 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 439/439 places, 2480/2480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 91 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2024-05-23 17:46:51] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:46:51] [INFO ] Invariant cache hit.
[2024-05-23 17:46:51] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-23 17:46:51] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:46:51] [INFO ] Invariant cache hit.
[2024-05-23 17:46:51] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-05-23 17:46:53] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2024-05-23 17:46:53] [INFO ] Redundant transitions in 188 ms returned []
Running 2472 sub problems to find dead transitions.
[2024-05-23 17:46:53] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:46:53] [INFO ] Invariant cache hit.
[2024-05-23 17:46:53] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2024-05-23 17:47:20] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 4 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 2 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-23 17:47:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:47:22] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 6 ms to minimize.
[2024-05-23 17:47:22] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 3 ms to minimize.
[2024-05-23 17:47:22] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 5 ms to minimize.
[2024-05-23 17:47:23] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 4 ms to minimize.
[2024-05-23 17:47:23] [INFO ] Deduced a trap composed of 99 places in 307 ms of which 4 ms to minimize.
[2024-05-23 17:47:23] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 39 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 2472/2472 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2024-05-23 17:47:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 17:47:36] [INFO ] Deduced a trap composed of 76 places in 466 ms of which 4 ms to minimize.
[2024-05-23 17:47:37] [INFO ] Deduced a trap composed of 82 places in 472 ms of which 4 ms to minimize.
[2024-05-23 17:47:37] [INFO ] Deduced a trap composed of 94 places in 462 ms of which 5 ms to minimize.
[2024-05-23 17:47:38] [INFO ] Deduced a trap composed of 76 places in 468 ms of which 5 ms to minimize.
[2024-05-23 17:47:38] [INFO ] Deduced a trap composed of 101 places in 468 ms of which 4 ms to minimize.
[2024-05-23 17:47:39] [INFO ] Deduced a trap composed of 97 places in 422 ms of which 5 ms to minimize.
[2024-05-23 17:47:39] [INFO ] Deduced a trap composed of 86 places in 457 ms of which 5 ms to minimize.
[2024-05-23 17:47:40] [INFO ] Deduced a trap composed of 118 places in 433 ms of which 4 ms to minimize.
[2024-05-23 17:47:40] [INFO ] Deduced a trap composed of 116 places in 412 ms of which 4 ms to minimize.
[2024-05-23 17:47:41] [INFO ] Deduced a trap composed of 104 places in 524 ms of which 4 ms to minimize.
[2024-05-23 17:47:41] [INFO ] Deduced a trap composed of 79 places in 481 ms of which 5 ms to minimize.
[2024-05-23 17:47:42] [INFO ] Deduced a trap composed of 89 places in 468 ms of which 4 ms to minimize.
[2024-05-23 17:47:42] [INFO ] Deduced a trap composed of 82 places in 465 ms of which 4 ms to minimize.
[2024-05-23 17:47:43] [INFO ] Deduced a trap composed of 72 places in 472 ms of which 4 ms to minimize.
[2024-05-23 17:47:43] [INFO ] Deduced a trap composed of 81 places in 459 ms of which 5 ms to minimize.
[2024-05-23 17:47:44] [INFO ] Deduced a trap composed of 80 places in 508 ms of which 5 ms to minimize.
[2024-05-23 17:47:44] [INFO ] Deduced a trap composed of 84 places in 473 ms of which 4 ms to minimize.
[2024-05-23 17:47:45] [INFO ] Deduced a trap composed of 58 places in 474 ms of which 7 ms to minimize.
[2024-05-23 17:47:45] [INFO ] Deduced a trap composed of 88 places in 532 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2024-05-23 17:47:53] [INFO ] Deduced a trap composed of 86 places in 474 ms of which 5 ms to minimize.
[2024-05-23 17:47:54] [INFO ] Deduced a trap composed of 100 places in 420 ms of which 5 ms to minimize.
[2024-05-23 17:47:54] [INFO ] Deduced a trap composed of 90 places in 482 ms of which 4 ms to minimize.
[2024-05-23 17:47:55] [INFO ] Deduced a trap composed of 88 places in 488 ms of which 4 ms to minimize.
SMT process timed out in 62252ms, After SMT, problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 62284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64607 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 400000 steps (8 resets) in 8067 ms. (49 steps per ms) remains 104/220 properties
Running SMT prover for 104 properties.
[2024-05-23 17:47:57] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:47:57] [INFO ] Invariant cache hit.
[2024-05-23 17:47:57] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-23 17:47:57] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-23 17:47:58] [INFO ] After 523ms SMT Verify possible using state equation in real domain returned unsat :0 sat :104
[2024-05-23 17:47:58] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-05-23 17:47:59] [INFO ] After 908ms SMT Verify possible using 613 Read/Feed constraints in real domain returned unsat :0 sat :104
TRAPS : Iteration 0
[2024-05-23 17:48:06] [INFO ] After 8154ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:104
[2024-05-23 17:48:06] [INFO ] After 8937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:104
[2024-05-23 17:48:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-23 17:48:06] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-23 17:48:07] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :104
[2024-05-23 17:48:08] [INFO ] After 1127ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :104
TRAPS : Iteration 0
[2024-05-23 17:48:08] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 3 ms to minimize.
[2024-05-23 17:48:09] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 4 ms to minimize.
[2024-05-23 17:48:09] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 4 ms to minimize.
[2024-05-23 17:48:10] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 4 ms to minimize.
[2024-05-23 17:48:10] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 3 ms to minimize.
[2024-05-23 17:48:10] [INFO ] Deduced a trap composed of 60 places in 349 ms of which 3 ms to minimize.
[2024-05-23 17:48:11] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 3 ms to minimize.
[2024-05-23 17:48:11] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 3 ms to minimize.
[2024-05-23 17:48:11] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 4 ms to minimize.
[2024-05-23 17:48:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3440 ms
[2024-05-23 17:48:12] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 4 ms to minimize.
[2024-05-23 17:48:12] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:48:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 738 ms
[2024-05-23 17:48:13] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 4 ms to minimize.
[2024-05-23 17:48:13] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2024-05-23 17:48:13] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 2 ms to minimize.
[2024-05-23 17:48:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 902 ms
[2024-05-23 17:48:13] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:48:13] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:48:14] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:48:14] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:48:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 621 ms
[2024-05-23 17:48:14] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:48:14] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:48:15] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:48:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 671 ms
[2024-05-23 17:48:15] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-05-23 17:48:15] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-23 17:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-23 17:48:16] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:48:16] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2024-05-23 17:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2024-05-23 17:48:16] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-23 17:48:17] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-05-23 17:48:17] [INFO ] Deduced a trap composed of 42 places in 369 ms of which 4 ms to minimize.
[2024-05-23 17:48:18] [INFO ] Deduced a trap composed of 44 places in 366 ms of which 3 ms to minimize.
[2024-05-23 17:48:18] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2024-05-23 17:48:18] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 3 ms to minimize.
[2024-05-23 17:48:18] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:48:19] [INFO ] Deduced a trap composed of 98 places in 367 ms of which 4 ms to minimize.
[2024-05-23 17:48:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1950 ms
[2024-05-23 17:48:20] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 3 ms to minimize.
[2024-05-23 17:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2024-05-23 17:48:20] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-23 17:48:21] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-23 17:48:21] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-23 17:48:21] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-23 17:48:22] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-23 17:48:22] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-23 17:48:25] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:48:25] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:48:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2024-05-23 17:48:26] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-23 17:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
TRAPS : Iteration 1
[2024-05-23 17:48:27] [INFO ] Deduced a trap composed of 118 places in 355 ms of which 4 ms to minimize.
[2024-05-23 17:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2024-05-23 17:48:30] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-05-23 17:48:31] [INFO ] Deduced a trap composed of 87 places in 322 ms of which 3 ms to minimize.
[2024-05-23 17:48:31] [INFO ] Deduced a trap composed of 86 places in 360 ms of which 4 ms to minimize.
[2024-05-23 17:48:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 813 ms
[2024-05-23 17:48:32] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-23 17:48:33] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:48:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
TRAPS : Iteration 2
[2024-05-23 17:48:36] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-23 17:48:37] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-23 17:48:38] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-23 17:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-23 17:48:39] [INFO ] Deduced a trap composed of 64 places in 372 ms of which 4 ms to minimize.
[2024-05-23 17:48:39] [INFO ] Deduced a trap composed of 64 places in 427 ms of which 4 ms to minimize.
[2024-05-23 17:48:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 927 ms
TRAPS : Iteration 3
[2024-05-23 17:48:51] [INFO ] After 44418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :104
[2024-05-23 17:48:53] [INFO ] After 46622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :104
RANDOM walk for 647300 steps (0 resets) in 120004 ms. (5 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1505/1505 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1505/1505 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 87076 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-23 17:50:51] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:50:51] [INFO ] Invariant cache hit.
[2024-05-23 17:50:51] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:51:30] [INFO ] Deduced a trap composed of 32 places in 483 ms of which 5 ms to minimize.
[2024-05-23 17:51:31] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 4 ms to minimize.
[2024-05-23 17:51:31] [INFO ] Deduced a trap composed of 23 places in 450 ms of which 4 ms to minimize.
[2024-05-23 17:51:32] [INFO ] Deduced a trap composed of 34 places in 447 ms of which 5 ms to minimize.
[2024-05-23 17:51:32] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 4 ms to minimize.
[2024-05-23 17:51:33] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 4 ms to minimize.
[2024-05-23 17:51:33] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 5 ms to minimize.
[2024-05-23 17:51:33] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 3 ms to minimize.
[2024-05-23 17:51:34] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 3 ms to minimize.
[2024-05-23 17:51:34] [INFO ] Deduced a trap composed of 88 places in 389 ms of which 5 ms to minimize.
[2024-05-23 17:51:35] [INFO ] Deduced a trap composed of 27 places in 393 ms of which 4 ms to minimize.
[2024-05-23 17:51:35] [INFO ] Deduced a trap composed of 117 places in 440 ms of which 5 ms to minimize.
[2024-05-23 17:51:36] [INFO ] Deduced a trap composed of 102 places in 432 ms of which 4 ms to minimize.
[2024-05-23 17:51:36] [INFO ] Deduced a trap composed of 93 places in 444 ms of which 4 ms to minimize.
[2024-05-23 17:51:37] [INFO ] Deduced a trap composed of 108 places in 412 ms of which 4 ms to minimize.
[2024-05-23 17:51:37] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-05-23 17:51:37] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 3 ms to minimize.
[2024-05-23 17:51:38] [INFO ] Deduced a trap composed of 98 places in 439 ms of which 4 ms to minimize.
[2024-05-23 17:51:38] [INFO ] Deduced a trap composed of 94 places in 432 ms of which 4 ms to minimize.
[2024-05-23 17:51:39] [INFO ] Deduced a trap composed of 116 places in 429 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:51:40] [INFO ] Deduced a trap composed of 41 places in 380 ms of which 4 ms to minimize.
[2024-05-23 17:51:41] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 4 ms to minimize.
[2024-05-23 17:51:41] [INFO ] Deduced a trap composed of 54 places in 389 ms of which 4 ms to minimize.
[2024-05-23 17:51:41] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 4 ms to minimize.
[2024-05-23 17:51:42] [INFO ] Deduced a trap composed of 101 places in 445 ms of which 4 ms to minimize.
[2024-05-23 17:51:42] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 5 ms to minimize.
[2024-05-23 17:51:43] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 4 ms to minimize.
[2024-05-23 17:51:43] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 5 ms to minimize.
[2024-05-23 17:51:44] [INFO ] Deduced a trap composed of 35 places in 421 ms of which 4 ms to minimize.
[2024-05-23 17:51:44] [INFO ] Deduced a trap composed of 86 places in 411 ms of which 4 ms to minimize.
[2024-05-23 17:51:44] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:51:44] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:51:45] [INFO ] Deduced a trap composed of 103 places in 422 ms of which 4 ms to minimize.
[2024-05-23 17:51:45] [INFO ] Deduced a trap composed of 96 places in 416 ms of which 5 ms to minimize.
[2024-05-23 17:51:46] [INFO ] Deduced a trap composed of 109 places in 421 ms of which 5 ms to minimize.
[2024-05-23 17:51:46] [INFO ] Deduced a trap composed of 88 places in 423 ms of which 4 ms to minimize.
[2024-05-23 17:51:47] [INFO ] Deduced a trap composed of 119 places in 386 ms of which 4 ms to minimize.
[2024-05-23 17:51:47] [INFO ] Deduced a trap composed of 125 places in 376 ms of which 5 ms to minimize.
[2024-05-23 17:51:47] [INFO ] Deduced a trap composed of 101 places in 427 ms of which 4 ms to minimize.
[2024-05-23 17:51:48] [INFO ] Deduced a trap composed of 101 places in 493 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:51:50] [INFO ] Deduced a trap composed of 82 places in 433 ms of which 5 ms to minimize.
[2024-05-23 17:51:50] [INFO ] Deduced a trap composed of 117 places in 394 ms of which 4 ms to minimize.
[2024-05-23 17:51:51] [INFO ] Deduced a trap composed of 127 places in 396 ms of which 4 ms to minimize.
[2024-05-23 17:51:51] [INFO ] Deduced a trap composed of 83 places in 407 ms of which 5 ms to minimize.
[2024-05-23 17:51:51] [INFO ] Deduced a trap composed of 113 places in 405 ms of which 5 ms to minimize.
[2024-05-23 17:51:52] [INFO ] Deduced a trap composed of 107 places in 406 ms of which 4 ms to minimize.
[2024-05-23 17:51:52] [INFO ] Deduced a trap composed of 103 places in 403 ms of which 4 ms to minimize.
[2024-05-23 17:51:53] [INFO ] Deduced a trap composed of 74 places in 476 ms of which 4 ms to minimize.
[2024-05-23 17:51:53] [INFO ] Deduced a trap composed of 82 places in 431 ms of which 4 ms to minimize.
[2024-05-23 17:51:54] [INFO ] Deduced a trap composed of 100 places in 455 ms of which 4 ms to minimize.
[2024-05-23 17:51:54] [INFO ] Deduced a trap composed of 69 places in 466 ms of which 4 ms to minimize.
[2024-05-23 17:51:55] [INFO ] Deduced a trap composed of 91 places in 446 ms of which 4 ms to minimize.
[2024-05-23 17:51:55] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 4 ms to minimize.
[2024-05-23 17:51:56] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 4 ms to minimize.
[2024-05-23 17:51:56] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 5 ms to minimize.
[2024-05-23 17:51:57] [INFO ] Deduced a trap composed of 25 places in 411 ms of which 5 ms to minimize.
[2024-05-23 17:51:57] [INFO ] Deduced a trap composed of 108 places in 444 ms of which 4 ms to minimize.
[2024-05-23 17:51:58] [INFO ] Deduced a trap composed of 84 places in 432 ms of which 4 ms to minimize.
[2024-05-23 17:51:58] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2024-05-23 17:51:58] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:52:15] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 2 ms to minimize.
[2024-05-23 17:52:15] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:52:16] [INFO ] Deduced a trap composed of 88 places in 430 ms of which 4 ms to minimize.
[2024-05-23 17:52:16] [INFO ] Deduced a trap composed of 119 places in 476 ms of which 4 ms to minimize.
[2024-05-23 17:52:17] [INFO ] Deduced a trap composed of 96 places in 407 ms of which 4 ms to minimize.
[2024-05-23 17:52:17] [INFO ] Deduced a trap composed of 91 places in 409 ms of which 4 ms to minimize.
[2024-05-23 17:52:18] [INFO ] Deduced a trap composed of 88 places in 462 ms of which 5 ms to minimize.
[2024-05-23 17:52:18] [INFO ] Deduced a trap composed of 107 places in 416 ms of which 4 ms to minimize.
[2024-05-23 17:52:18] [INFO ] Deduced a trap composed of 106 places in 390 ms of which 4 ms to minimize.
[2024-05-23 17:52:19] [INFO ] Deduced a trap composed of 91 places in 403 ms of which 4 ms to minimize.
[2024-05-23 17:52:19] [INFO ] Deduced a trap composed of 101 places in 440 ms of which 4 ms to minimize.
[2024-05-23 17:52:20] [INFO ] Deduced a trap composed of 122 places in 435 ms of which 5 ms to minimize.
[2024-05-23 17:52:20] [INFO ] Deduced a trap composed of 122 places in 447 ms of which 4 ms to minimize.
[2024-05-23 17:52:21] [INFO ] Deduced a trap composed of 91 places in 490 ms of which 5 ms to minimize.
[2024-05-23 17:52:21] [INFO ] Deduced a trap composed of 124 places in 457 ms of which 4 ms to minimize.
[2024-05-23 17:52:22] [INFO ] Deduced a trap composed of 111 places in 443 ms of which 4 ms to minimize.
[2024-05-23 17:52:22] [INFO ] Deduced a trap composed of 87 places in 457 ms of which 4 ms to minimize.
[2024-05-23 17:52:23] [INFO ] Deduced a trap composed of 135 places in 448 ms of which 4 ms to minimize.
[2024-05-23 17:52:23] [INFO ] Deduced a trap composed of 111 places in 443 ms of which 4 ms to minimize.
[2024-05-23 17:52:24] [INFO ] Deduced a trap composed of 109 places in 466 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:52:26] [INFO ] Deduced a trap composed of 93 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:52:27] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 4 ms to minimize.
[2024-05-23 17:52:27] [INFO ] Deduced a trap composed of 131 places in 440 ms of which 4 ms to minimize.
[2024-05-23 17:52:27] [INFO ] Deduced a trap composed of 93 places in 424 ms of which 4 ms to minimize.
[2024-05-23 17:52:28] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:52:28] [INFO ] Deduced a trap composed of 94 places in 474 ms of which 4 ms to minimize.
[2024-05-23 17:52:29] [INFO ] Deduced a trap composed of 79 places in 493 ms of which 5 ms to minimize.
[2024-05-23 17:52:29] [INFO ] Deduced a trap composed of 105 places in 445 ms of which 4 ms to minimize.
[2024-05-23 17:52:30] [INFO ] Deduced a trap composed of 136 places in 480 ms of which 5 ms to minimize.
[2024-05-23 17:52:30] [INFO ] Deduced a trap composed of 120 places in 459 ms of which 4 ms to minimize.
[2024-05-23 17:52:31] [INFO ] Deduced a trap composed of 131 places in 442 ms of which 4 ms to minimize.
[2024-05-23 17:52:31] [INFO ] Deduced a trap composed of 3 places in 474 ms of which 5 ms to minimize.
[2024-05-23 17:52:32] [INFO ] Deduced a trap composed of 104 places in 448 ms of which 4 ms to minimize.
[2024-05-23 17:52:32] [INFO ] Deduced a trap composed of 131 places in 376 ms of which 3 ms to minimize.
[2024-05-23 17:52:32] [INFO ] Deduced a trap composed of 108 places in 400 ms of which 4 ms to minimize.
[2024-05-23 17:52:33] [INFO ] Deduced a trap composed of 104 places in 478 ms of which 5 ms to minimize.
[2024-05-23 17:52:33] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 4 ms to minimize.
[2024-05-23 17:52:34] [INFO ] Deduced a trap composed of 100 places in 438 ms of which 4 ms to minimize.
[2024-05-23 17:52:34] [INFO ] Deduced a trap composed of 136 places in 441 ms of which 4 ms to minimize.
[2024-05-23 17:52:35] [INFO ] Deduced a trap composed of 82 places in 459 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:52:38] [INFO ] Deduced a trap composed of 90 places in 361 ms of which 4 ms to minimize.
[2024-05-23 17:52:38] [INFO ] Deduced a trap composed of 97 places in 433 ms of which 4 ms to minimize.
[2024-05-23 17:52:39] [INFO ] Deduced a trap composed of 96 places in 389 ms of which 4 ms to minimize.
[2024-05-23 17:52:39] [INFO ] Deduced a trap composed of 94 places in 435 ms of which 4 ms to minimize.
[2024-05-23 17:52:39] [INFO ] Deduced a trap composed of 115 places in 421 ms of which 5 ms to minimize.
[2024-05-23 17:52:40] [INFO ] Deduced a trap composed of 79 places in 415 ms of which 5 ms to minimize.
[2024-05-23 17:52:40] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:52:40] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 2 ms to minimize.
[2024-05-23 17:52:40] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:52:41] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 4 ms to minimize.
[2024-05-23 17:52:41] [INFO ] Deduced a trap composed of 94 places in 464 ms of which 4 ms to minimize.
[2024-05-23 17:52:42] [INFO ] Deduced a trap composed of 91 places in 460 ms of which 4 ms to minimize.
[2024-05-23 17:52:42] [INFO ] Deduced a trap composed of 117 places in 470 ms of which 4 ms to minimize.
[2024-05-23 17:52:43] [INFO ] Deduced a trap composed of 97 places in 464 ms of which 4 ms to minimize.
[2024-05-23 17:52:43] [INFO ] Deduced a trap composed of 104 places in 435 ms of which 4 ms to minimize.
[2024-05-23 17:52:44] [INFO ] Deduced a trap composed of 86 places in 384 ms of which 4 ms to minimize.
[2024-05-23 17:52:44] [INFO ] Deduced a trap composed of 110 places in 479 ms of which 5 ms to minimize.
[2024-05-23 17:52:45] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 5 ms to minimize.
[2024-05-23 17:52:45] [INFO ] Deduced a trap composed of 95 places in 431 ms of which 4 ms to minimize.
[2024-05-23 17:52:45] [INFO ] Deduced a trap composed of 113 places in 405 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 145 constraints, problems are : Problem set: 0 solved, 1505 unsolved in 120039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 1505/1505 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 2 (OVERLAPS) 219/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 120/145 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:53:10] [INFO ] Deduced a trap composed of 27 places in 468 ms of which 4 ms to minimize.
[2024-05-23 17:53:11] [INFO ] Deduced a trap composed of 26 places in 477 ms of which 5 ms to minimize.
[2024-05-23 17:53:11] [INFO ] Deduced a trap composed of 66 places in 472 ms of which 5 ms to minimize.
[2024-05-23 17:53:12] [INFO ] Deduced a trap composed of 64 places in 471 ms of which 4 ms to minimize.
[2024-05-23 17:53:12] [INFO ] Deduced a trap composed of 99 places in 472 ms of which 4 ms to minimize.
[2024-05-23 17:53:13] [INFO ] Deduced a trap composed of 81 places in 439 ms of which 4 ms to minimize.
[2024-05-23 17:53:13] [INFO ] Deduced a trap composed of 93 places in 415 ms of which 4 ms to minimize.
[2024-05-23 17:53:14] [INFO ] Deduced a trap composed of 106 places in 443 ms of which 4 ms to minimize.
[2024-05-23 17:53:14] [INFO ] Deduced a trap composed of 102 places in 444 ms of which 4 ms to minimize.
[2024-05-23 17:53:15] [INFO ] Deduced a trap composed of 119 places in 474 ms of which 4 ms to minimize.
[2024-05-23 17:53:15] [INFO ] Deduced a trap composed of 118 places in 453 ms of which 5 ms to minimize.
[2024-05-23 17:53:16] [INFO ] Deduced a trap composed of 100 places in 434 ms of which 5 ms to minimize.
[2024-05-23 17:53:16] [INFO ] Deduced a trap composed of 133 places in 442 ms of which 5 ms to minimize.
[2024-05-23 17:53:17] [INFO ] Deduced a trap composed of 120 places in 438 ms of which 4 ms to minimize.
[2024-05-23 17:53:17] [INFO ] Deduced a trap composed of 96 places in 435 ms of which 4 ms to minimize.
[2024-05-23 17:53:18] [INFO ] Deduced a trap composed of 97 places in 442 ms of which 4 ms to minimize.
[2024-05-23 17:53:18] [INFO ] Deduced a trap composed of 94 places in 421 ms of which 4 ms to minimize.
[2024-05-23 17:53:18] [INFO ] Deduced a trap composed of 102 places in 415 ms of which 4 ms to minimize.
[2024-05-23 17:53:19] [INFO ] Deduced a trap composed of 134 places in 325 ms of which 4 ms to minimize.
[2024-05-23 17:53:19] [INFO ] Deduced a trap composed of 124 places in 412 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:53:23] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 4 ms to minimize.
[2024-05-23 17:53:25] [INFO ] Deduced a trap composed of 71 places in 462 ms of which 4 ms to minimize.
[2024-05-23 17:53:25] [INFO ] Deduced a trap composed of 51 places in 461 ms of which 4 ms to minimize.
[2024-05-23 17:53:26] [INFO ] Deduced a trap composed of 97 places in 474 ms of which 4 ms to minimize.
[2024-05-23 17:53:27] [INFO ] Deduced a trap composed of 99 places in 435 ms of which 5 ms to minimize.
[2024-05-23 17:53:27] [INFO ] Deduced a trap composed of 101 places in 389 ms of which 4 ms to minimize.
[2024-05-23 17:53:28] [INFO ] Deduced a trap composed of 93 places in 437 ms of which 5 ms to minimize.
[2024-05-23 17:53:28] [INFO ] Deduced a trap composed of 111 places in 374 ms of which 4 ms to minimize.
[2024-05-23 17:53:28] [INFO ] Deduced a trap composed of 89 places in 444 ms of which 4 ms to minimize.
[2024-05-23 17:53:29] [INFO ] Deduced a trap composed of 85 places in 442 ms of which 5 ms to minimize.
[2024-05-23 17:53:29] [INFO ] Deduced a trap composed of 97 places in 437 ms of which 4 ms to minimize.
[2024-05-23 17:53:30] [INFO ] Deduced a trap composed of 94 places in 445 ms of which 4 ms to minimize.
[2024-05-23 17:53:30] [INFO ] Deduced a trap composed of 108 places in 457 ms of which 4 ms to minimize.
[2024-05-23 17:53:31] [INFO ] Deduced a trap composed of 109 places in 457 ms of which 5 ms to minimize.
[2024-05-23 17:53:31] [INFO ] Deduced a trap composed of 108 places in 482 ms of which 4 ms to minimize.
[2024-05-23 17:53:32] [INFO ] Deduced a trap composed of 91 places in 375 ms of which 5 ms to minimize.
[2024-05-23 17:53:32] [INFO ] Deduced a trap composed of 63 places in 463 ms of which 5 ms to minimize.
[2024-05-23 17:53:33] [INFO ] Deduced a trap composed of 130 places in 464 ms of which 4 ms to minimize.
[2024-05-23 17:53:33] [INFO ] Deduced a trap composed of 97 places in 465 ms of which 4 ms to minimize.
[2024-05-23 17:53:34] [INFO ] Deduced a trap composed of 106 places in 460 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:53:39] [INFO ] Deduced a trap composed of 68 places in 447 ms of which 5 ms to minimize.
[2024-05-23 17:53:40] [INFO ] Deduced a trap composed of 90 places in 469 ms of which 4 ms to minimize.
[2024-05-23 17:53:41] [INFO ] Deduced a trap composed of 99 places in 415 ms of which 4 ms to minimize.
[2024-05-23 17:53:41] [INFO ] Deduced a trap composed of 100 places in 400 ms of which 4 ms to minimize.
[2024-05-23 17:53:42] [INFO ] Deduced a trap composed of 93 places in 390 ms of which 4 ms to minimize.
[2024-05-23 17:53:42] [INFO ] Deduced a trap composed of 66 places in 457 ms of which 4 ms to minimize.
[2024-05-23 17:53:43] [INFO ] Deduced a trap composed of 88 places in 471 ms of which 4 ms to minimize.
[2024-05-23 17:53:43] [INFO ] Deduced a trap composed of 70 places in 453 ms of which 5 ms to minimize.
[2024-05-23 17:53:44] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 4 ms to minimize.
[2024-05-23 17:53:44] [INFO ] Deduced a trap composed of 53 places in 451 ms of which 4 ms to minimize.
[2024-05-23 17:53:45] [INFO ] Deduced a trap composed of 89 places in 434 ms of which 4 ms to minimize.
[2024-05-23 17:53:45] [INFO ] Deduced a trap composed of 66 places in 423 ms of which 5 ms to minimize.
[2024-05-23 17:53:46] [INFO ] Deduced a trap composed of 60 places in 432 ms of which 4 ms to minimize.
[2024-05-23 17:53:46] [INFO ] Deduced a trap composed of 108 places in 454 ms of which 5 ms to minimize.
[2024-05-23 17:53:47] [INFO ] Deduced a trap composed of 72 places in 424 ms of which 4 ms to minimize.
[2024-05-23 17:53:47] [INFO ] Deduced a trap composed of 80 places in 466 ms of which 4 ms to minimize.
[2024-05-23 17:53:48] [INFO ] Deduced a trap composed of 89 places in 423 ms of which 4 ms to minimize.
[2024-05-23 17:53:48] [INFO ] Deduced a trap composed of 78 places in 469 ms of which 4 ms to minimize.
[2024-05-23 17:53:49] [INFO ] Deduced a trap composed of 84 places in 392 ms of which 4 ms to minimize.
[2024-05-23 17:53:49] [INFO ] Deduced a trap composed of 100 places in 477 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:53:53] [INFO ] Deduced a trap composed of 96 places in 325 ms of which 4 ms to minimize.
[2024-05-23 17:53:53] [INFO ] Deduced a trap composed of 74 places in 436 ms of which 4 ms to minimize.
[2024-05-23 17:53:53] [INFO ] Deduced a trap composed of 95 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:53:54] [INFO ] Deduced a trap composed of 88 places in 415 ms of which 4 ms to minimize.
[2024-05-23 17:53:54] [INFO ] Deduced a trap composed of 100 places in 421 ms of which 5 ms to minimize.
[2024-05-23 17:53:55] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:53:55] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-23 17:53:55] [INFO ] Deduced a trap composed of 111 places in 335 ms of which 3 ms to minimize.
[2024-05-23 17:53:56] [INFO ] Deduced a trap composed of 92 places in 424 ms of which 4 ms to minimize.
[2024-05-23 17:53:56] [INFO ] Deduced a trap composed of 110 places in 400 ms of which 4 ms to minimize.
[2024-05-23 17:53:57] [INFO ] Deduced a trap composed of 93 places in 427 ms of which 4 ms to minimize.
[2024-05-23 17:53:57] [INFO ] Deduced a trap composed of 74 places in 402 ms of which 3 ms to minimize.
[2024-05-23 17:53:58] [INFO ] Deduced a trap composed of 65 places in 451 ms of which 4 ms to minimize.
[2024-05-23 17:53:59] [INFO ] Deduced a trap composed of 95 places in 480 ms of which 4 ms to minimize.
[2024-05-23 17:53:59] [INFO ] Deduced a trap composed of 97 places in 471 ms of which 4 ms to minimize.
[2024-05-23 17:54:00] [INFO ] Deduced a trap composed of 61 places in 450 ms of which 4 ms to minimize.
[2024-05-23 17:54:00] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 4 ms to minimize.
[2024-05-23 17:54:01] [INFO ] Deduced a trap composed of 76 places in 463 ms of which 4 ms to minimize.
[2024-05-23 17:54:01] [INFO ] Deduced a trap composed of 84 places in 435 ms of which 4 ms to minimize.
[2024-05-23 17:54:01] [INFO ] Deduced a trap composed of 50 places in 447 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:54:05] [INFO ] Deduced a trap composed of 25 places in 444 ms of which 5 ms to minimize.
[2024-05-23 17:54:08] [INFO ] Deduced a trap composed of 58 places in 446 ms of which 4 ms to minimize.
[2024-05-23 17:54:08] [INFO ] Deduced a trap composed of 98 places in 429 ms of which 4 ms to minimize.
[2024-05-23 17:54:09] [INFO ] Deduced a trap composed of 92 places in 415 ms of which 4 ms to minimize.
[2024-05-23 17:54:09] [INFO ] Deduced a trap composed of 88 places in 453 ms of which 4 ms to minimize.
[2024-05-23 17:54:09] [INFO ] Deduced a trap composed of 79 places in 433 ms of which 4 ms to minimize.
[2024-05-23 17:54:10] [INFO ] Deduced a trap composed of 77 places in 422 ms of which 4 ms to minimize.
[2024-05-23 17:54:10] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:54:11] [INFO ] Deduced a trap composed of 22 places in 436 ms of which 4 ms to minimize.
[2024-05-23 17:54:11] [INFO ] Deduced a trap composed of 66 places in 428 ms of which 5 ms to minimize.
[2024-05-23 17:54:12] [INFO ] Deduced a trap composed of 51 places in 425 ms of which 4 ms to minimize.
[2024-05-23 17:54:12] [INFO ] Deduced a trap composed of 59 places in 365 ms of which 4 ms to minimize.
[2024-05-23 17:54:12] [INFO ] Deduced a trap composed of 53 places in 362 ms of which 4 ms to minimize.
[2024-05-23 17:54:13] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 4 ms to minimize.
[2024-05-23 17:54:13] [INFO ] Deduced a trap composed of 63 places in 382 ms of which 4 ms to minimize.
[2024-05-23 17:54:14] [INFO ] Deduced a trap composed of 52 places in 355 ms of which 4 ms to minimize.
[2024-05-23 17:54:14] [INFO ] Deduced a trap composed of 100 places in 354 ms of which 4 ms to minimize.
[2024-05-23 17:54:14] [INFO ] Deduced a trap composed of 88 places in 367 ms of which 4 ms to minimize.
[2024-05-23 17:54:15] [INFO ] Deduced a trap composed of 112 places in 431 ms of which 4 ms to minimize.
[2024-05-23 17:54:15] [INFO ] Deduced a trap composed of 111 places in 350 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:54:22] [INFO ] Deduced a trap composed of 83 places in 404 ms of which 4 ms to minimize.
[2024-05-23 17:54:23] [INFO ] Deduced a trap composed of 72 places in 430 ms of which 5 ms to minimize.
[2024-05-23 17:54:23] [INFO ] Deduced a trap composed of 104 places in 440 ms of which 4 ms to minimize.
[2024-05-23 17:54:23] [INFO ] Deduced a trap composed of 88 places in 436 ms of which 4 ms to minimize.
[2024-05-23 17:54:24] [INFO ] Deduced a trap composed of 82 places in 434 ms of which 4 ms to minimize.
[2024-05-23 17:54:24] [INFO ] Deduced a trap composed of 64 places in 413 ms of which 4 ms to minimize.
[2024-05-23 17:54:25] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 4 ms to minimize.
[2024-05-23 17:54:25] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:54:26] [INFO ] Deduced a trap composed of 102 places in 394 ms of which 4 ms to minimize.
[2024-05-23 17:54:26] [INFO ] Deduced a trap composed of 96 places in 405 ms of which 4 ms to minimize.
[2024-05-23 17:54:26] [INFO ] Deduced a trap composed of 84 places in 397 ms of which 5 ms to minimize.
[2024-05-23 17:54:27] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 5 ms to minimize.
[2024-05-23 17:54:27] [INFO ] Deduced a trap composed of 79 places in 392 ms of which 5 ms to minimize.
[2024-05-23 17:54:28] [INFO ] Deduced a trap composed of 85 places in 393 ms of which 3 ms to minimize.
[2024-05-23 17:54:28] [INFO ] Deduced a trap composed of 99 places in 405 ms of which 4 ms to minimize.
[2024-05-23 17:54:29] [INFO ] Deduced a trap composed of 98 places in 418 ms of which 5 ms to minimize.
[2024-05-23 17:54:29] [INFO ] Deduced a trap composed of 79 places in 362 ms of which 4 ms to minimize.
[2024-05-23 17:54:29] [INFO ] Deduced a trap composed of 88 places in 364 ms of which 3 ms to minimize.
[2024-05-23 17:54:30] [INFO ] Deduced a trap composed of 85 places in 363 ms of which 3 ms to minimize.
[2024-05-23 17:54:30] [INFO ] Deduced a trap composed of 80 places in 373 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
[2024-05-23 17:54:35] [INFO ] Deduced a trap composed of 98 places in 418 ms of which 4 ms to minimize.
[2024-05-23 17:54:35] [INFO ] Deduced a trap composed of 82 places in 412 ms of which 4 ms to minimize.
[2024-05-23 17:54:36] [INFO ] Deduced a trap composed of 114 places in 402 ms of which 5 ms to minimize.
[2024-05-23 17:54:36] [INFO ] Deduced a trap composed of 110 places in 312 ms of which 4 ms to minimize.
[2024-05-23 17:54:36] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 4 ms to minimize.
[2024-05-23 17:54:39] [INFO ] Deduced a trap composed of 101 places in 397 ms of which 4 ms to minimize.
[2024-05-23 17:54:39] [INFO ] Deduced a trap composed of 90 places in 393 ms of which 4 ms to minimize.
[2024-05-23 17:54:40] [INFO ] Deduced a trap composed of 93 places in 390 ms of which 4 ms to minimize.
[2024-05-23 17:54:40] [INFO ] Deduced a trap composed of 78 places in 395 ms of which 4 ms to minimize.
[2024-05-23 17:54:41] [INFO ] Deduced a trap composed of 84 places in 386 ms of which 3 ms to minimize.
[2024-05-23 17:54:41] [INFO ] Deduced a trap composed of 85 places in 355 ms of which 4 ms to minimize.
[2024-05-23 17:54:43] [INFO ] Deduced a trap composed of 67 places in 421 ms of which 4 ms to minimize.
[2024-05-23 17:54:44] [INFO ] Deduced a trap composed of 95 places in 383 ms of which 4 ms to minimize.
[2024-05-23 17:54:44] [INFO ] Deduced a trap composed of 124 places in 353 ms of which 3 ms to minimize.
[2024-05-23 17:54:44] [INFO ] Deduced a trap composed of 102 places in 402 ms of which 4 ms to minimize.
[2024-05-23 17:54:45] [INFO ] Deduced a trap composed of 96 places in 409 ms of which 4 ms to minimize.
[2024-05-23 17:54:45] [INFO ] Deduced a trap composed of 125 places in 419 ms of which 4 ms to minimize.
[2024-05-23 17:54:46] [INFO ] Deduced a trap composed of 123 places in 404 ms of which 4 ms to minimize.
[2024-05-23 17:54:46] [INFO ] Deduced a trap composed of 123 places in 415 ms of which 4 ms to minimize.
[2024-05-23 17:54:46] [INFO ] Deduced a trap composed of 100 places in 424 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1505 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1471 variables, and 285 constraints, problems are : Problem set: 0 solved, 1505 unsolved in 120029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 0/1505 constraints, Known Traps: 260/260 constraints]
After SMT, in 241248ms problems are : Problem set: 0 solved, 1505 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 220 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 88 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 439/439 places, 2480/2480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 87 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2024-05-23 17:54:53] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:54:53] [INFO ] Invariant cache hit.
[2024-05-23 17:54:53] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 17:54:53] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:54:53] [INFO ] Invariant cache hit.
[2024-05-23 17:54:53] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-05-23 17:54:55] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-23 17:54:55] [INFO ] Redundant transitions in 79 ms returned []
Running 2472 sub problems to find dead transitions.
[2024-05-23 17:54:55] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:54:55] [INFO ] Invariant cache hit.
[2024-05-23 17:54:55] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2024-05-23 17:55:22] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 4 ms to minimize.
[2024-05-23 17:55:22] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 2 ms to minimize.
[2024-05-23 17:55:22] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 2 ms to minimize.
[2024-05-23 17:55:22] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:55:22] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:55:22] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:55:23] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-23 17:55:23] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 17:55:23] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 4 ms to minimize.
[2024-05-23 17:55:23] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 3 ms to minimize.
[2024-05-23 17:55:24] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 4 ms to minimize.
[2024-05-23 17:55:24] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 4 ms to minimize.
[2024-05-23 17:55:24] [INFO ] Deduced a trap composed of 99 places in 275 ms of which 4 ms to minimize.
[2024-05-23 17:55:24] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 39 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 2472/2472 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2024-05-23 17:55:30] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-23 17:55:37] [INFO ] Deduced a trap composed of 76 places in 467 ms of which 4 ms to minimize.
[2024-05-23 17:55:37] [INFO ] Deduced a trap composed of 82 places in 468 ms of which 4 ms to minimize.
[2024-05-23 17:55:38] [INFO ] Deduced a trap composed of 94 places in 446 ms of which 5 ms to minimize.
[2024-05-23 17:55:38] [INFO ] Deduced a trap composed of 76 places in 439 ms of which 4 ms to minimize.
[2024-05-23 17:55:39] [INFO ] Deduced a trap composed of 101 places in 436 ms of which 5 ms to minimize.
[2024-05-23 17:55:39] [INFO ] Deduced a trap composed of 97 places in 449 ms of which 5 ms to minimize.
[2024-05-23 17:55:40] [INFO ] Deduced a trap composed of 86 places in 418 ms of which 4 ms to minimize.
[2024-05-23 17:55:40] [INFO ] Deduced a trap composed of 118 places in 389 ms of which 4 ms to minimize.
[2024-05-23 17:55:40] [INFO ] Deduced a trap composed of 116 places in 416 ms of which 4 ms to minimize.
[2024-05-23 17:55:41] [INFO ] Deduced a trap composed of 104 places in 466 ms of which 4 ms to minimize.
[2024-05-23 17:55:42] [INFO ] Deduced a trap composed of 79 places in 479 ms of which 4 ms to minimize.
[2024-05-23 17:55:42] [INFO ] Deduced a trap composed of 89 places in 469 ms of which 4 ms to minimize.
[2024-05-23 17:55:43] [INFO ] Deduced a trap composed of 82 places in 456 ms of which 4 ms to minimize.
[2024-05-23 17:55:43] [INFO ] Deduced a trap composed of 72 places in 471 ms of which 4 ms to minimize.
[2024-05-23 17:55:44] [INFO ] Deduced a trap composed of 81 places in 459 ms of which 4 ms to minimize.
[2024-05-23 17:55:44] [INFO ] Deduced a trap composed of 80 places in 466 ms of which 5 ms to minimize.
[2024-05-23 17:55:44] [INFO ] Deduced a trap composed of 84 places in 449 ms of which 4 ms to minimize.
[2024-05-23 17:55:45] [INFO ] Deduced a trap composed of 58 places in 472 ms of which 5 ms to minimize.
[2024-05-23 17:55:45] [INFO ] Deduced a trap composed of 88 places in 455 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
[2024-05-23 17:55:53] [INFO ] Deduced a trap composed of 86 places in 458 ms of which 4 ms to minimize.
[2024-05-23 17:55:54] [INFO ] Deduced a trap composed of 100 places in 432 ms of which 5 ms to minimize.
[2024-05-23 17:55:54] [INFO ] Deduced a trap composed of 90 places in 464 ms of which 5 ms to minimize.
[2024-05-23 17:55:55] [INFO ] Deduced a trap composed of 88 places in 469 ms of which 4 ms to minimize.
[2024-05-23 17:55:55] [INFO ] Deduced a trap composed of 98 places in 398 ms of which 4 ms to minimize.
[2024-05-23 17:55:56] [INFO ] Deduced a trap composed of 95 places in 470 ms of which 4 ms to minimize.
[2024-05-23 17:55:56] [INFO ] Deduced a trap composed of 88 places in 456 ms of which 4 ms to minimize.
[2024-05-23 17:55:57] [INFO ] Deduced a trap composed of 79 places in 452 ms of which 4 ms to minimize.
SMT process timed out in 62086ms, After SMT, problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 62115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64284 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 400000 steps (8 resets) in 4987 ms. (80 steps per ms) remains 107/220 properties
Running SMT prover for 107 properties.
[2024-05-23 17:55:58] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:55:58] [INFO ] Invariant cache hit.
[2024-05-23 17:55:58] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-23 17:55:58] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-23 17:55:59] [INFO ] After 538ms SMT Verify possible using state equation in real domain returned unsat :0 sat :107
[2024-05-23 17:55:59] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-05-23 17:56:00] [INFO ] After 890ms SMT Verify possible using 613 Read/Feed constraints in real domain returned unsat :0 sat :107
TRAPS : Iteration 0
[2024-05-23 17:56:07] [INFO ] After 8197ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:107
[2024-05-23 17:56:07] [INFO ] After 9001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:107
[2024-05-23 17:56:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-23 17:56:07] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-23 17:56:08] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :107
[2024-05-23 17:56:09] [INFO ] After 1170ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :107
TRAPS : Iteration 0
[2024-05-23 17:56:10] [INFO ] Deduced a trap composed of 3 places in 477 ms of which 4 ms to minimize.
[2024-05-23 17:56:10] [INFO ] Deduced a trap composed of 5 places in 402 ms of which 4 ms to minimize.
[2024-05-23 17:56:10] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 2 ms to minimize.
[2024-05-23 17:56:11] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:56:11] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:56:11] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 17:56:11] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:56:11] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:56:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2033 ms
[2024-05-23 17:56:11] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:56:12] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-05-23 17:56:12] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:56:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2024-05-23 17:56:12] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:56:12] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 17:56:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2024-05-23 17:56:13] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-23 17:56:13] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-05-23 17:56:13] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-05-23 17:56:14] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:56:14] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-23 17:56:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2024-05-23 17:56:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-23 17:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-05-23 17:56:14] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 3 ms to minimize.
[2024-05-23 17:56:15] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2024-05-23 17:56:15] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 2 ms to minimize.
[2024-05-23 17:56:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 887 ms
[2024-05-23 17:56:15] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-23 17:56:15] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:56:16] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:56:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2024-05-23 17:56:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-23 17:56:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 17:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-23 17:56:16] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-05-23 17:56:17] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:56:17] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:56:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2024-05-23 17:56:18] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:56:19] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-23 17:56:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2024-05-23 17:56:19] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:56:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-23 17:56:19] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:56:20] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 4 ms to minimize.
[2024-05-23 17:56:20] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 4 ms to minimize.
[2024-05-23 17:56:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 981 ms
[2024-05-23 17:56:21] [INFO ] Deduced a trap composed of 91 places in 328 ms of which 4 ms to minimize.
[2024-05-23 17:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2024-05-23 17:56:21] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-05-23 17:56:21] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:56:22] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:56:22] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:56:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2024-05-23 17:56:24] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
TRAPS : Iteration 1
[2024-05-23 17:56:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-23 17:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-23 17:56:26] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:56:26] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:56:26] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:56:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 614 ms
[2024-05-23 17:56:27] [INFO ] Deduced a trap composed of 78 places in 369 ms of which 4 ms to minimize.
[2024-05-23 17:56:27] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 2 ms to minimize.
[2024-05-23 17:56:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 685 ms
[2024-05-23 17:56:29] [INFO ] Deduced a trap composed of 101 places in 327 ms of which 3 ms to minimize.
[2024-05-23 17:56:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2024-05-23 17:56:30] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:56:30] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-05-23 17:56:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2024-05-23 17:56:31] [INFO ] Deduced a trap composed of 84 places in 334 ms of which 4 ms to minimize.
[2024-05-23 17:56:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2024-05-23 17:56:32] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-05-23 17:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-05-23 17:56:32] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-23 17:56:33] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-23 17:56:35] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:56:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
TRAPS : Iteration 2
[2024-05-23 17:56:40] [INFO ] Deduced a trap composed of 66 places in 447 ms of which 5 ms to minimize.
[2024-05-23 17:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
TRAPS : Iteration 3
[2024-05-23 17:56:51] [INFO ] After 43438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :107
[2024-05-23 17:56:53] [INFO ] After 45698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :107
RANDOM walk for 451 steps (0 resets) in 6 ms. (64 steps per ms) remains 0/1 properties
RANDOM walk for 1398 steps (0 resets) in 12 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 1764 steps (0 resets) in 12 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 1126 steps (0 resets) in 7 ms. (140 steps per ms) remains 0/1 properties
RANDOM walk for 2054 steps (0 resets) in 11 ms. (171 steps per ms) remains 0/1 properties
RANDOM walk for 1410 steps (0 resets) in 9 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 2471 steps (0 resets) in 16 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 2108 steps (0 resets) in 10 ms. (191 steps per ms) remains 0/1 properties
RANDOM walk for 2934 steps (0 resets) in 16 ms. (172 steps per ms) remains 0/1 properties
RANDOM walk for 2610 steps (0 resets) in 12 ms. (200 steps per ms) remains 0/1 properties
RANDOM walk for 3411 steps (0 resets) in 15 ms. (213 steps per ms) remains 0/1 properties
RANDOM walk for 3023 steps (0 resets) in 15 ms. (188 steps per ms) remains 0/1 properties
RANDOM walk for 240 steps (0 resets) in 6 ms. (34 steps per ms) remains 0/1 properties
RANDOM walk for 3606 steps (0 resets) in 15 ms. (225 steps per ms) remains 0/1 properties
RANDOM walk for 1525 steps (0 resets) in 9 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 2080 steps (0 resets) in 11 ms. (173 steps per ms) remains 0/1 properties
RANDOM walk for 2594 steps (0 resets) in 12 ms. (199 steps per ms) remains 0/1 properties
RANDOM walk for 3193 steps (0 resets) in 14 ms. (212 steps per ms) remains 0/1 properties
RANDOM walk for 3512 steps (0 resets) in 14 ms. (234 steps per ms) remains 0/1 properties
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 714 steps (0 resets) in 7 ms. (89 steps per ms) remains 0/1 properties
RANDOM walk for 2121 steps (0 resets) in 13 ms. (151 steps per ms) remains 0/1 properties
RANDOM walk for 2530 steps (0 resets) in 12 ms. (194 steps per ms) remains 0/1 properties
RANDOM walk for 3081 steps (0 resets) in 15 ms. (192 steps per ms) remains 0/1 properties
RANDOM walk for 3526 steps (0 resets) in 19 ms. (176 steps per ms) remains 0/1 properties
RANDOM walk for 136 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
RANDOM walk for 578 steps (0 resets) in 7 ms. (72 steps per ms) remains 0/1 properties
RANDOM walk for 937 steps (0 resets) in 4 ms. (187 steps per ms) remains 0/1 properties
RANDOM walk for 2761 steps (0 resets) in 16 ms. (162 steps per ms) remains 0/1 properties
RANDOM walk for 3099 steps (0 resets) in 17 ms. (172 steps per ms) remains 0/1 properties
RANDOM walk for 3521 steps (0 resets) in 20 ms. (167 steps per ms) remains 0/1 properties
RANDOM walk for 78 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 604 steps (0 resets) in 7 ms. (75 steps per ms) remains 0/1 properties
RANDOM walk for 1106 steps (0 resets) in 7 ms. (138 steps per ms) remains 0/1 properties
RANDOM walk for 1993 steps (0 resets) in 13 ms. (142 steps per ms) remains 0/1 properties
RANDOM walk for 3118 steps (0 resets) in 16 ms. (183 steps per ms) remains 0/1 properties
RANDOM walk for 3452 steps (0 resets) in 93 ms. (36 steps per ms) remains 0/1 properties
RANDOM walk for 179 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
RANDOM walk for 529 steps (0 resets) in 7 ms. (66 steps per ms) remains 0/1 properties
RANDOM walk for 1113 steps (0 resets) in 7 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 1586 steps (0 resets) in 9 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 560 steps (0 resets) in 6 ms. (80 steps per ms) remains 0/1 properties
RANDOM walk for 1984 steps (0 resets) in 12 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 3614 steps (0 resets) in 19 ms. (180 steps per ms) remains 0/1 properties
RANDOM walk for 166 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
RANDOM walk for 515 steps (0 resets) in 7 ms. (64 steps per ms) remains 0/1 properties
RANDOM walk for 1202 steps (0 resets) in 8 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 1732 steps (0 resets) in 12 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 2201 steps (0 resets) in 13 ms. (157 steps per ms) remains 0/1 properties
RANDOM walk for 2629 steps (0 resets) in 16 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 1263 steps (0 resets) in 9 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 1569 steps (0 resets) in 9 ms. (156 steps per ms) remains 0/1 properties
RANDOM walk for 2165 steps (0 resets) in 13 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 2427 steps (0 resets) in 14 ms. (161 steps per ms) remains 0/1 properties
RANDOM walk for 3283 steps (0 resets) in 17 ms. (182 steps per ms) remains 0/1 properties
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
RANDOM walk for 30094 steps (7 resets) in 130 ms. (229 steps per ms) remains 0/1 properties
RANDOM walk for 503 steps (0 resets) in 7 ms. (62 steps per ms) remains 0/1 properties
RANDOM walk for 29 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 1190 steps (0 resets) in 8 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 1552 steps (0 resets) in 12 ms. (119 steps per ms) remains 0/1 properties
RANDOM walk for 86 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 1906 steps (0 resets) in 10 ms. (173 steps per ms) remains 0/1 properties
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 2461 steps (0 resets) in 12 ms. (189 steps per ms) remains 0/1 properties
RANDOM walk for 23 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 3195 steps (0 resets) in 13 ms. (228 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 74 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 3594 steps (0 resets) in 14 ms. (239 steps per ms) remains 0/1 properties
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336771 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 336771 steps, saw 230412 distinct states, run finished after 3006 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 17:56:57] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:56:57] [INFO ] Invariant cache hit.
[2024-05-23 17:56:57] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:56:57] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:56:58] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:56:58] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:56:59] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:56:59] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:56:59] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:56:59] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:56:59] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 2/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 954 steps, including 48 resets, run visited all 1 properties in 7 ms. (steps per millisecond=136 )
Parikh walk visited 1 properties in 17 ms.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 342756 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342756 steps, saw 234381 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-23 17:57:03] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:03] [INFO ] Invariant cache hit.
[2024-05-23 17:57:03] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:04] [INFO ] Deduced a trap composed of 3 places in 466 ms of which 5 ms to minimize.
[2024-05-23 17:57:04] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:57:04] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:57:04] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:57:04] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:57:05] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2024-05-23 17:57:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:57:05] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2128 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2816ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3668 steps, including 216 resets, run visited all 1 properties in 20 ms. (steps per millisecond=183 )
Parikh walk visited 1 properties in 20 ms.
RANDOM walk for 135 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 341424 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341424 steps, saw 233468 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-23 17:57:08] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:08] [INFO ] Invariant cache hit.
[2024-05-23 17:57:08] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:09] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:10] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 3 ms to minimize.
[2024-05-23 17:57:10] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:57:10] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:57:10] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-23 17:57:10] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2244ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4843 steps, including 201 resets, run visited all 1 properties in 25 ms. (steps per millisecond=193 )
Parikh walk visited 1 properties in 28 ms.
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 337770 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337770 steps, saw 231044 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 17:57:14] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:14] [INFO ] Invariant cache hit.
[2024-05-23 17:57:14] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:14] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:15] [INFO ] Deduced a trap composed of 62 places in 443 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:16] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2024-05-23 17:57:16] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 2 ms to minimize.
[2024-05-23 17:57:16] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:57:16] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:57:16] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:57:16] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2771ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
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 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331380 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331380 steps, saw 226941 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 17:57:20] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:20] [INFO ] Invariant cache hit.
[2024-05-23 17:57:20] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:20] [INFO ] Deduced a trap composed of 62 places in 471 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:22] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 4 ms to minimize.
[2024-05-23 17:57:22] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 3 ms to minimize.
[2024-05-23 17:57:22] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2024-05-23 17:57:22] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:57:22] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 2 ms to minimize.
[2024-05-23 17:57:23] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-23 17:57:23] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2153 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3390ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 335367 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335367 steps, saw 229507 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 17:57:26] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:26] [INFO ] Invariant cache hit.
[2024-05-23 17:57:26] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:26] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:27] [INFO ] Deduced a trap composed of 62 places in 473 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:28] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 4 ms to minimize.
[2024-05-23 17:57:28] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 3 ms to minimize.
[2024-05-23 17:57:28] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:57:29] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:57:29] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2972ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 116 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 50092 steps, run visited all 1 properties in 398 ms. (steps per millisecond=125 )
Probabilistic random walk after 50092 steps, saw 33955 distinct states, run finished after 403 ms. (steps per millisecond=124 ) properties seen :1
RANDOM walk for 14287 steps (2 resets) in 44 ms. (317 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 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33901 steps (7 resets) in 28 ms. (1169 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 321642 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 321642 steps, saw 220671 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-23 17:57:33] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:33] [INFO ] Invariant cache hit.
[2024-05-23 17:57:33] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:33] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:34] [INFO ] Deduced a trap composed of 83 places in 478 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:35] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 4 ms to minimize.
[2024-05-23 17:57:35] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 4 ms to minimize.
[2024-05-23 17:57:35] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 3 ms to minimize.
[2024-05-23 17:57:36] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:57:36] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:57:36] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 6/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3291ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6946 steps, including 171 resets, run visited all 1 properties in 34 ms. (steps per millisecond=204 )
Parikh walk visited 1 properties in 34 ms.
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 339561 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 339561 steps, saw 232198 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-23 17:57:39] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:39] [INFO ] Invariant cache hit.
[2024-05-23 17:57:39] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:40] [INFO ] Deduced a trap composed of 82 places in 457 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:41] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 4 ms to minimize.
[2024-05-23 17:57:42] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 3 ms to minimize.
[2024-05-23 17:57:42] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 2 ms to minimize.
[2024-05-23 17:57:42] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2024-05-23 17:57:42] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 2 ms to minimize.
[2024-05-23 17:57:42] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:57:42] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:57:43] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:57:43] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2379 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3759ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326790 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326790 steps, saw 224101 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-23 17:57:46] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:46] [INFO ] Invariant cache hit.
[2024-05-23 17:57:46] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:46] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:47] [INFO ] Deduced a trap composed of 93 places in 462 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:48] [INFO ] Deduced a trap composed of 73 places in 461 ms of which 4 ms to minimize.
[2024-05-23 17:57:49] [INFO ] Deduced a trap composed of 118 places in 456 ms of which 5 ms to minimize.
[2024-05-23 17:57:49] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:49] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2289 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3519ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 92 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 283651 steps, run visited all 1 properties in 2309 ms. (steps per millisecond=122 )
Probabilistic random walk after 283651 steps, saw 161256 distinct states, run finished after 2309 ms. (steps per millisecond=122 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327672 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327672 steps, saw 224687 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-23 17:57:55] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:57:55] [INFO ] Invariant cache hit.
[2024-05-23 17:57:55] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:57:56] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2024-05-23 17:57:57] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2024-05-23 17:57:57] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:57:57] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2091ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 93 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42388 steps, run visited all 1 properties in 358 ms. (steps per millisecond=118 )
Probabilistic random walk after 42388 steps, saw 29288 distinct states, run finished after 358 ms. (steps per millisecond=118 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 329355 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 329355 steps, saw 225597 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-23 17:58:01] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:58:01] [INFO ] Invariant cache hit.
[2024-05-23 17:58:01] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:01] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:02] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 85 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 25369 steps, run visited all 1 properties in 215 ms. (steps per millisecond=117 )
Probabilistic random walk after 25369 steps, saw 18443 distinct states, run finished after 215 ms. (steps per millisecond=117 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125332 steps, run visited all 1 properties in 1131 ms. (steps per millisecond=110 )
Probabilistic random walk after 125332 steps, saw 90604 distinct states, run finished after 1132 ms. (steps per millisecond=110 ) properties seen :1
RANDOM walk for 32159 steps (6 resets) in 101 ms. (315 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 330912 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 330912 steps, saw 226586 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 17:58:07] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:58:07] [INFO ] Invariant cache hit.
[2024-05-23 17:58:07] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:07] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:08] [INFO ] Deduced a trap composed of 102 places in 413 ms of which 4 ms to minimize.
[2024-05-23 17:58:08] [INFO ] Deduced a trap composed of 87 places in 415 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:10] [INFO ] Deduced a trap composed of 17 places in 433 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:10] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 1/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2901ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 72 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 330552 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 330552 steps, saw 226330 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 17:58:13] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:58:13] [INFO ] Invariant cache hit.
[2024-05-23 17:58:13] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:13] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:14] [INFO ] Deduced a trap composed of 112 places in 413 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:15] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 3 ms to minimize.
[2024-05-23 17:58:15] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:58:15] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:58:15] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:58:15] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:58:16] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-23 17:58:16] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 85 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 365850 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 365850 steps, saw 202782 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-23 17:58:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 17:58:19] [INFO ] Computed 25 invariants in 4 ms
[2024-05-23 17:58:19] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:19] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:20] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:21] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 4 ms to minimize.
[2024-05-23 17:58:21] [INFO ] Deduced a trap composed of 59 places in 323 ms of which 4 ms to minimize.
[2024-05-23 17:58:21] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 3 ms to minimize.
[2024-05-23 17:58:22] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 4 ms to minimize.
[2024-05-23 17:58:22] [INFO ] Deduced a trap composed of 46 places in 304 ms of which 4 ms to minimize.
[2024-05-23 17:58:22] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-05-23 17:58:22] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2692 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3349ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 945 steps, including 51 resets, run visited all 1 properties in 4 ms. (steps per millisecond=236 )
Parikh walk visited 1 properties in 5 ms.
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 333054 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 333054 steps, saw 227960 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 17:58:26] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-05-23 17:58:26] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 17:58:26] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:27] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 4 ms to minimize.
[2024-05-23 17:58:27] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
[2024-05-23 17:58:28] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 3 ms to minimize.
[2024-05-23 17:58:28] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 3 ms to minimize.
[2024-05-23 17:58:28] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 2 ms to minimize.
[2024-05-23 17:58:28] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:29] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3082ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 83 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 392/439 places, 2104/2480 transitions.
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 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 79774 steps, run visited all 1 properties in 651 ms. (steps per millisecond=122 )
Probabilistic random walk after 79774 steps, saw 51497 distinct states, run finished after 652 ms. (steps per millisecond=122 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 216349 steps, run visited all 1 properties in 1975 ms. (steps per millisecond=109 )
Probabilistic random walk after 216349 steps, saw 151963 distinct states, run finished after 1975 ms. (steps per millisecond=109 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332667 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332667 steps, saw 227673 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 17:58:35] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:58:35] [INFO ] Invariant cache hit.
[2024-05-23 17:58:35] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:35] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:36] [INFO ] Deduced a trap composed of 74 places in 493 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 2 ms to minimize.
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 2 ms to minimize.
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:58:37] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:38] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:58:38] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 2/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1990 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 81 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367155 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367155 steps, saw 203217 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-23 17:58:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 17:58:41] [INFO ] Computed 25 invariants in 3 ms
[2024-05-23 17:58:41] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:41] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:43] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 4 ms to minimize.
[2024-05-23 17:58:43] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 3 ms to minimize.
[2024-05-23 17:58:43] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1961ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 17:58:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 17:58:43] [INFO ] Invariant cache hit.
[2024-05-23 17:58:44] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-23 17:58:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 17:58:44] [INFO ] Invariant cache hit.
[2024-05-23 17:58:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 17:58:47] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3383 ms to find 0 implicit places.
[2024-05-23 17:58:47] [INFO ] Redundant transitions in 59 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 17:58:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 17:58:47] [INFO ] Invariant cache hit.
[2024-05-23 17:58:47] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 17:59:13] [INFO ] Deduced a trap composed of 3 places in 452 ms of which 5 ms to minimize.
[2024-05-23 17:59:14] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 4 ms to minimize.
[2024-05-23 17:59:14] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 3 ms to minimize.
[2024-05-23 17:59:14] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-23 17:59:14] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:59:14] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 17:59:15] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 5 ms to minimize.
[2024-05-23 17:59:15] [INFO ] Deduced a trap composed of 71 places in 350 ms of which 4 ms to minimize.
[2024-05-23 17:59:16] [INFO ] Deduced a trap composed of 124 places in 379 ms of which 5 ms to minimize.
[2024-05-23 17:59:16] [INFO ] Deduced a trap composed of 41 places in 419 ms of which 5 ms to minimize.
[2024-05-23 17:59:17] [INFO ] Deduced a trap composed of 25 places in 604 ms of which 5 ms to minimize.
[2024-05-23 17:59:17] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 5 ms to minimize.
[2024-05-23 17:59:17] [INFO ] Deduced a trap composed of 62 places in 353 ms of which 5 ms to minimize.
[2024-05-23 17:59:18] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 5 ms to minimize.
[2024-05-23 17:59:18] [INFO ] Deduced a trap composed of 30 places in 459 ms of which 4 ms to minimize.
SMT process timed out in 31399ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31424ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34945 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 10 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 99 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-23 17:59:18] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 17:59:18] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-23 17:59:19] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 17:59:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 17:59:19] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:59:19] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:59:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-23 17:59:19] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:59:19] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:59:19] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:59:19] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 420 ms.
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 282537 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282537 steps, saw 195518 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-23 17:59:22] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-05-23 17:59:22] [INFO ] Computed 25 invariants in 7 ms
[2024-05-23 17:59:22] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:24] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 6 ms to minimize.
[2024-05-23 17:59:24] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2572ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7910 steps, including 348 resets, run visited all 1 properties in 48 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 49 ms.
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 310453 steps, run visited all 1 properties in 2858 ms. (steps per millisecond=108 )
Probabilistic random walk after 310453 steps, saw 213638 distinct states, run finished after 2862 ms. (steps per millisecond=108 ) properties seen :1
RANDOM walk for 33798 steps (7 resets) in 96 ms. (348 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 335763 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335763 steps, saw 229763 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 17:59:31] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:59:31] [INFO ] Invariant cache hit.
[2024-05-23 17:59:31] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:31] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:32] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1885ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 34 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 121939 steps, run visited all 1 properties in 1506 ms. (steps per millisecond=80 )
Probabilistic random walk after 121939 steps, saw 88261 distinct states, run finished after 1510 ms. (steps per millisecond=80 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 152530 steps, run visited all 1 properties in 1253 ms. (steps per millisecond=121 )
Probabilistic random walk after 152530 steps, saw 109091 distinct states, run finished after 1253 ms. (steps per millisecond=121 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 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 57841 steps, run visited all 1 properties in 470 ms. (steps per millisecond=123 )
Probabilistic random walk after 57841 steps, saw 43343 distinct states, run finished after 470 ms. (steps per millisecond=123 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 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
Interrupted probabilistic random walk after 299754 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 299754 steps, saw 206784 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-23 17:59:39] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:59:39] [INFO ] Invariant cache hit.
[2024-05-23 17:59:39] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:39] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:40] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-05-23 17:59:40] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:59:41] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:41] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1433 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 143 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 66877 steps, run visited all 1 properties in 725 ms. (steps per millisecond=92 )
Probabilistic random walk after 66877 steps, saw 43806 distinct states, run finished after 725 ms. (steps per millisecond=92 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 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 255337 steps, run visited all 1 properties in 2143 ms. (steps per millisecond=119 )
Probabilistic random walk after 255337 steps, saw 177662 distinct states, run finished after 2144 ms. (steps per millisecond=119 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 236968 steps, run visited all 1 properties in 2141 ms. (steps per millisecond=110 )
Probabilistic random walk after 236968 steps, saw 165541 distinct states, run finished after 2144 ms. (steps per millisecond=110 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 39895 steps, run visited all 1 properties in 331 ms. (steps per millisecond=120 )
Probabilistic random walk after 39895 steps, saw 30366 distinct states, run finished after 332 ms. (steps per millisecond=120 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31660 steps, run visited all 1 properties in 258 ms. (steps per millisecond=122 )
Probabilistic random walk after 31660 steps, saw 24188 distinct states, run finished after 258 ms. (steps per millisecond=122 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 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 41470 steps, run visited all 1 properties in 436 ms. (steps per millisecond=95 )
Probabilistic random walk after 41470 steps, saw 31542 distinct states, run finished after 437 ms. (steps per millisecond=94 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351630 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 351630 steps, saw 240269 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-23 17:59:51] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:59:51] [INFO ] Invariant cache hit.
[2024-05-23 17:59:51] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:51] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:53] [INFO ] Deduced a trap composed of 3 places in 575 ms of which 6 ms to minimize.
[2024-05-23 17:59:53] [INFO ] Deduced a trap composed of 3 places in 463 ms of which 5 ms to minimize.
[2024-05-23 17:59:54] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 4 ms to minimize.
[2024-05-23 17:59:54] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 3 ms to minimize.
[2024-05-23 17:59:54] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2024-05-23 17:59:54] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2884 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3755ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 92 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6307 steps, run visited all 1 properties in 52 ms. (steps per millisecond=121 )
Probabilistic random walk after 6307 steps, saw 5034 distinct states, run finished after 52 ms. (steps per millisecond=121 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351216 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 351216 steps, saw 240040 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-23 17:59:58] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 17:59:58] [INFO ] Invariant cache hit.
[2024-05-23 17:59:58] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:59:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:00] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 3 ms to minimize.
[2024-05-23 18:00:00] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 4 ms to minimize.
[2024-05-23 18:00:00] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 3 ms to minimize.
[2024-05-23 18:00:00] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2836ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 205144 steps, run visited all 1 properties in 1960 ms. (steps per millisecond=104 )
Probabilistic random walk after 205144 steps, saw 144594 distinct states, run finished after 1960 ms. (steps per millisecond=104 ) 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 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 249595 steps, run visited all 1 properties in 2310 ms. (steps per millisecond=108 )
Probabilistic random walk after 249595 steps, saw 173972 distinct states, run finished after 2310 ms. (steps per millisecond=108 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 68947 steps, run visited all 1 properties in 789 ms. (steps per millisecond=87 )
Probabilistic random walk after 68947 steps, saw 51453 distinct states, run finished after 789 ms. (steps per millisecond=87 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 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 3607 steps, run visited all 1 properties in 32 ms. (steps per millisecond=112 )
Probabilistic random walk after 3607 steps, saw 3038 distinct states, run finished after 32 ms. (steps per millisecond=112 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 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 2743 steps, run visited all 1 properties in 26 ms. (steps per millisecond=105 )
Probabilistic random walk after 2743 steps, saw 2310 distinct states, run finished after 26 ms. (steps per millisecond=105 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 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 102976 steps, run visited all 1 properties in 858 ms. (steps per millisecond=120 )
Probabilistic random walk after 102976 steps, saw 75092 distinct states, run finished after 858 ms. (steps per millisecond=120 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 288234 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 288234 steps, saw 199270 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-23 18:00:10] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 18:00:10] [INFO ] Invariant cache hit.
[2024-05-23 18:00:11] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:11] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:12] [INFO ] Deduced a trap composed of 6 places in 684 ms of which 6 ms to minimize.
[2024-05-23 18:00:13] [INFO ] Deduced a trap composed of 3 places in 616 ms of which 6 ms to minimize.
[2024-05-23 18:00:13] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-05-23 18:00:13] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:14] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3796ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 140 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 53494 steps, run visited all 1 properties in 656 ms. (steps per millisecond=81 )
Probabilistic random walk after 53494 steps, saw 35913 distinct states, run finished after 656 ms. (steps per millisecond=81 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 296370 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 296370 steps, saw 204526 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-23 18:00:18] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 18:00:18] [INFO ] Invariant cache hit.
[2024-05-23 18:00:18] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:18] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:20] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 3 ms to minimize.
[2024-05-23 18:00:20] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:21] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1082 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 138 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 77137 steps, run visited all 1 properties in 790 ms. (steps per millisecond=97 )
Probabilistic random walk after 77137 steps, saw 50056 distinct states, run finished after 790 ms. (steps per millisecond=97 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 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
Interrupted probabilistic random walk after 350190 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 350190 steps, saw 239391 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-23 18:00:25] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 18:00:25] [INFO ] Invariant cache hit.
[2024-05-23 18:00:25] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:25] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:26] [INFO ] Deduced a trap composed of 111 places in 499 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:28] [INFO ] Deduced a trap composed of 19 places in 644 ms of which 6 ms to minimize.
[2024-05-23 18:00:28] [INFO ] Deduced a trap composed of 100 places in 651 ms of which 6 ms to minimize.
[2024-05-23 18:00:29] [INFO ] Deduced a trap composed of 122 places in 624 ms of which 6 ms to minimize.
[2024-05-23 18:00:30] [INFO ] Deduced a trap composed of 95 places in 596 ms of which 6 ms to minimize.
[2024-05-23 18:00:30] [INFO ] Deduced a trap composed of 95 places in 601 ms of which 6 ms to minimize.
[2024-05-23 18:00:31] [INFO ] Deduced a trap composed of 109 places in 595 ms of which 6 ms to minimize.
[2024-05-23 18:00:31] [INFO ] Deduced a trap composed of 120 places in 499 ms of which 6 ms to minimize.
[2024-05-23 18:00:32] [INFO ] Deduced a trap composed of 115 places in 551 ms of which 7 ms to minimize.
SMT process timed out in 6838ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 133 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44404 steps, run visited all 1 properties in 564 ms. (steps per millisecond=78 )
Probabilistic random walk after 44404 steps, saw 30493 distinct states, run finished after 565 ms. (steps per millisecond=78 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 55222 steps, run visited all 1 properties in 457 ms. (steps per millisecond=120 )
Probabilistic random walk after 55222 steps, saw 41490 distinct states, run finished after 457 ms. (steps per millisecond=120 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 107971 steps, run visited all 1 properties in 1077 ms. (steps per millisecond=100 )
Probabilistic random walk after 107971 steps, saw 78544 distinct states, run finished after 1078 ms. (steps per millisecond=100 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 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 1672 steps, run visited all 1 properties in 18 ms. (steps per millisecond=92 )
Probabilistic random walk after 1672 steps, saw 1440 distinct states, run finished after 18 ms. (steps per millisecond=92 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 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 934 steps, run visited all 1 properties in 16 ms. (steps per millisecond=58 )
Probabilistic random walk after 934 steps, saw 817 distinct states, run finished after 17 ms. (steps per millisecond=54 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 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 177568 steps, run visited all 1 properties in 1983 ms. (steps per millisecond=89 )
Probabilistic random walk after 177568 steps, saw 126126 distinct states, run finished after 1983 ms. (steps per millisecond=89 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 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 132847 steps, run visited all 1 properties in 1313 ms. (steps per millisecond=101 )
Probabilistic random walk after 132847 steps, saw 95688 distinct states, run finished after 1313 ms. (steps per millisecond=101 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355941 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355941 steps, saw 243192 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 18:00:41] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 18:00:41] [INFO ] Invariant cache hit.
[2024-05-23 18:00:41] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:41] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 122/175 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/281 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/435 variables, 70/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 25/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 294/729 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/729 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/743 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/743 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 728/1471 variables, 308/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 541/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 122/175 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/281 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/435 variables, 70/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 25/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 294/729 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/729 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/743 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/743 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/743 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 728/1471 variables, 308/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 541/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1948ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 128 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 55807 steps, run visited all 1 properties in 721 ms. (steps per millisecond=77 )
Probabilistic random walk after 55807 steps, saw 37430 distinct states, run finished after 721 ms. (steps per millisecond=77 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42955 steps, run visited all 1 properties in 610 ms. (steps per millisecond=70 )
Probabilistic random walk after 42955 steps, saw 32641 distinct states, run finished after 610 ms. (steps per millisecond=70 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13687 steps, run visited all 1 properties in 183 ms. (steps per millisecond=74 )
Probabilistic random walk after 13687 steps, saw 10769 distinct states, run finished after 183 ms. (steps per millisecond=74 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10825 steps, run visited all 1 properties in 140 ms. (steps per millisecond=77 )
Probabilistic random walk after 10825 steps, saw 8660 distinct states, run finished after 140 ms. (steps per millisecond=77 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4669 steps, run visited all 1 properties in 63 ms. (steps per millisecond=74 )
Probabilistic random walk after 4669 steps, saw 3888 distinct states, run finished after 63 ms. (steps per millisecond=74 ) properties seen :1
RANDOM walk for 545 steps (0 resets) in 8 ms. (60 steps per ms) remains 0/1 properties
RANDOM walk for 815 steps (0 resets) in 8 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 1368 steps (0 resets) in 9 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 1950 steps (0 resets) in 11 ms. (162 steps per ms) remains 0/1 properties
RANDOM walk for 2531 steps (0 resets) in 15 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 2746 steps (0 resets) in 16 ms. (161 steps per ms) remains 0/1 properties
RANDOM walk for 3367 steps (0 resets) in 17 ms. (187 steps per ms) remains 0/1 properties
RANDOM walk for 454 steps (0 resets) in 4 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 987 steps (0 resets) in 8 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 1464 steps (0 resets) in 12 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 1828 steps (0 resets) in 11 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 2591 steps (0 resets) in 13 ms. (185 steps per ms) remains 0/1 properties
RANDOM walk for 3172 steps (0 resets) in 15 ms. (198 steps per ms) remains 0/1 properties
RANDOM walk for 3673 steps (0 resets) in 18 ms. (193 steps per ms) remains 0/1 properties
RANDOM walk for 3846 steps (0 resets) in 20 ms. (183 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 321489 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 321489 steps, saw 220600 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-23 18:00:48] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-05-23 18:00:48] [INFO ] Invariant cache hit.
[2024-05-23 18:00:48] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:50] [INFO ] Deduced a trap composed of 13 places in 701 ms of which 7 ms to minimize.
[2024-05-23 18:00:51] [INFO ] Deduced a trap composed of 72 places in 714 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:52] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-05-23 18:00:52] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
[2024-05-23 18:00:52] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 3/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3126 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3944ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 124 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 364221 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 364221 steps, saw 202003 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-23 18:00:56] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-23 18:00:56] [INFO ] Computed 25 invariants in 5 ms
[2024-05-23 18:00:56] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:00:57] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 105 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 104 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-23 18:00:58] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 18:00:58] [INFO ] Invariant cache hit.
[2024-05-23 18:00:58] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-23 18:00:58] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 18:00:58] [INFO ] Invariant cache hit.
[2024-05-23 18:00:59] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 18:01:02] [INFO ] Implicit Places using invariants and state equation in 3279 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2024-05-23 18:01:02] [INFO ] Redundant transitions in 92 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-23 18:01:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-23 18:01:02] [INFO ] Invariant cache hit.
[2024-05-23 18:01:02] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-23 18:01:27] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 4 ms to minimize.
[2024-05-23 18:01:27] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-05-23 18:01:27] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2024-05-23 18:01:28] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-05-23 18:01:28] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:01:28] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:01:28] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-23 18:01:28] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 3 ms to minimize.
[2024-05-23 18:01:28] [INFO ] Deduced a trap composed of 124 places in 255 ms of which 3 ms to minimize.
[2024-05-23 18:01:29] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 4 ms to minimize.
[2024-05-23 18:01:29] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 3 ms to minimize.
[2024-05-23 18:01:29] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-05-23 18:01:30] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 3 ms to minimize.
[2024-05-23 18:01:30] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 3 ms to minimize.
[2024-05-23 18:01:30] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 3 ms to minimize.
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-08"
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-08, 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-171636274400119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 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 '
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 ;