About the Execution of GreatSPN+red for ShieldRVt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2452.275 | 1800000.00 | 3375270.00 | 2576.50 | [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.r364-tall-171683778300648.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 ShieldRVt-PT-050B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683778300648
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 614K May 18 16:43 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 StableMarking
=== Now, execution of the tool begins
BK_START 1716917440066
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:30:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-28 17:30:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:30:41] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-28 17:30:41] [INFO ] Transformed 2503 places.
[2024-05-28 17:30:41] [INFO ] Transformed 2503 transitions.
[2024-05-28 17:30:41] [INFO ] Found NUPN structural information;
[2024-05-28 17:30:41] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 328 ms.
Structural test allowed to assert that 1001 places are NOT stable. Took 21 ms.
RANDOM walk for 40000 steps (9 resets) in 4390 ms. (9 steps per ms) remains 1166/1502 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 33 ms. (3 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 36 ms. (3 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1166/1166 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1166/1166 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-05-28 17:30:43] [INFO ] Computed 201 invariants in 37 ms
Error getting values : (error "ParserException while parsing response: ((s51 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s192 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s227 (/ 1.0 2.0))
(s228 (/ 1.0 2.0))
(s229 (/ 1.0 2.0))
(s230 (/ 1.0 2.0))
(s231 (/ 1.0 2.0))
(s232 (/ 1.0 2.0))
(s233 (/ 1.0 2.0))
(s234 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s283 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s290 (/ 1.0 2.0))
(s291 (/ 1.0 2.0))
(s292 (/ 1.0 2.0))
(s293 (/ 1.0 2.0))
(s294 (/ 1.0 2.0))
(s295 (/ 1.0 2.0))
(s303 (/ 1.0 2.0))
(s304 (/ 1.0 2.0))
(s305 (/ 1.0 2.0))
(s306 (/ 1.0 2.0))
(s307 (/ 1.0 2.0))
(s308 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s316 (/ 1.0 2.0))
(s317 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s327 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s340 (/ 1.0 2.0))
(s341 (/ 1.0 2.0))
(s342 (/ 1.0 2.0))
(s343 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s352 (/ 1.0 2.0))
(s353 (/ 1.0 2.0))
(s354 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s364 (/ 1.0 2.0))
(s365 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s367 (/ 1.0 2.0))
(s368 (/ 1.0 2.0))
(s369 (/ 1.0 2.0))
(s374 (/ 1.0 2.0))
(s375 (/ 1.0 2.0))
(s376 (/ 1.0 2.0))
(s377 (/ 1.0 2.0))
(s378 (/ 1.0 2.0))
(s379 (/ 1.0 2.0))
(s380 (/ 1.0 2.0))
(s381 (/ 1.0 2.0))
(s386 (/ 1.0 2.0))
(s387 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s390 (/ 1.0 2.0))
(s391 (/ 1.0 2.0))
(s392 (/ 1.0 2.0))
(s393 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s413 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s426 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s453 (/ 1.0 2.0))
(s454 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s476 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s478 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s512 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s521 (/ 1.0 2.0))
(s522 (/ 1.0 2.0))
(s523 (/ 1.0 2.0))
(s524 (/ 1.0 2.0))
(s525 (/ 1.0 2.0))
(s526 (/ 1.0 2.0))
(s527 (/ 1.0 2.0))
(s528 (/ 1.0 2.0))
(s533 (/ 1.0 2.0))
(s534 (/ 1.0 2.0))
(s535 (/ 1.0 2.0))
(s536 (/ 1.0 2.0))
(s537 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s540 (/ 1.0 2.0))
(s548 (/ 1.0 2.0))
(s549 (/ 1.0 2.0))
(s550 (/ 1.0 2.0))
(s551 (/ 1.0 2.0))
(s552 (/ 1.0 2.0))
(s553 (/ 1.0 2.0))
(s554 (/ 1.0 2.0))
(s555 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s562 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s571 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s583 (/ 1.0 2.0))
(s584 (/ 1.0 2.0))
(s585 (/ 1.0 2.0))
(s586 (/ 1.0 2.0))
(s587 (/ 1.0 2.0))
(s588 (/ 1.0 2.0))
(s589 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s603 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s609 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s613 (/ 1.0 2.0))
(s614 (/ 1.0 2.0))
(s619 (/ 1.0 2.0))
(s620 (/ 1.0 2.0))
(s621 (/ 1.0 2.0))
(s622 (/ 1.0 2.0))
(s623 (/ 1.0 2.0))
(s624 (/ 1.0 2.0))
(s625 (/ 1.0 2.0))
(s626 (/ 1.0 2.0))
(s631 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s637 (/ 1.0 2.0))
(s638 (/ 1.0 2.0))
(s646 (/ 1.0 2.0))
(s647 (/ 1.0 2.0))
(s648 (/ 1.0 2.0))
(s649 (/ 1.0 2.0))
(s650 (/ 1.0 2.0))
(s651 (/ 1.0 2.0))
(s652 (/ 1.0 2.0))
(s653 (/ 1.0 2.0))
(s658 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s660 (/ 1.0 2.0))
(s661 (/ 1.0 2.0))
(s662 (/ 1.0 2.0))
(s663 (/ 1.0 2.0))
(s668 (/ 1.0 2.0))
(s669 (/ 1.0 2.0))
(s670 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s673 (/ 1.0 2.0))
(s674 (/ 1.0 2.0))
(s675 (/ 1.0 2.0))
(s680 (/ 1.0 2.0))
(s681 (/ 1.0 2.0))
(s682 (/ 1.0 2.0))
(s683 (/ 1.0 2.0))
(s684 (/ 1.0 2.0))
(s685 (/ 1.0 2.0))
(s686 (/ 1.0 2.0))
(s687 (/ 1.0 2.0))
(s695 (/ 1.0 2.0))
(s696 (/ 1.0 2.0))
(s697 (/ 1.0 2.0))
(s698 (/ 1.0 2.0))
(s699 (/ 1.0 2.0))
(s700 (/ 1.0 2.0))
(s701 (/ 1.0 2.0))
(s702 (/ 1.0 2.0))
(s707 (/ 1.0 2.0))
(s708 (/ 1.0 2.0))
(s709 (/ 1.0 2.0))
(s710 (/ 1.0 2.0))
(s711 (/ 1.0 2.0))
(s712 (/ 1.0 2.0))
(s717 (/ 1.0 2.0))
(s718 (/ 1.0 2.0))
(s719 (/ 1.0 2.0))
(s720 (/ 1.0 2.0))
(s721 (/ 1.0 2.0))
(s722 (/ 1.0 2.0))
(s723 (/ 1.0 2.0))
(s724 (/ 1.0 2.0))
(s729 (/ 1.0 2.0))
(s730 (/ 1.0 2.0))
(s731 (/ 1.0 2.0))
(s732 (/ 1.0 2.0))
(s733 (/ 1.0 2.0))
(s734 (/ 1.0 2.0))
(s735 (/ 1.0 2.0))
(s736 (/ 1.0 2.0))
(s744 (/ 1.0 2.0))
(s745 (/ 1.0 2.0))
(s746 (/ 1.0 2.0))
(s747 (/ 1.0 2.0))
(s748 (/ 1.0 2.0))
(s749 (/ 1.0 2.0))
(s750 (/ 1.0 2.0))
(s751 (/ 1.0 2.0))
(s756 (/ 1.0 2.0))
(s757 (/ 1.0 2.0))
(s758 (/ 1.0 2.0))
(s759 (/ 1.0 2.0))
(s760 (/ 1.0 2.0))
(s761 (/ 1.0 2.0))
(s766 (/ 1.0 2.0))
(s767 (/ 1.0 2.0))
(s768 (/ 1.0 2.0))
(s769 (/ 1.0 2.0))
(s770 (/ 1.0 2.0))
(s771 (/ 1.0 2.0))
(s772 (/ 1.0 2.0))
(s773 (/ 1.0 2.0))
(s778 (/ 1.0 2.0))
(s779 (/ 1.0 2.0))
(s780 (/ 1.0 2.0))
(s781 (/ 1.0 2.0))
(s782 (/ 1.0 2.0))
(s783 (/ 1.0 2.0))
(s784 (/ 1.0 2.0))
(s785 (/ 1.0 2.0))
(s793 (/ 1.0 2.0))
(s794 (/ 1.0 2.0))
(s795 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s799 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s809 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s815 (/ 1.0 2.0))
(s816 (/ 1.0 2.0))
(s817 (/ 1.0 2.0))
(s818 (/ 1.0 2.0))
(s819 (/ 1.0 2.0))
(s820 (/ 1.0 2.0))
(s821 (/ 1.0 2.0))
(s822 (/ 1.0 2.0))
(s827 (/ 1.0 2.0))
(s828 (/ 1.0 2.0))
(s829 (/ 1.0 2.0))
(s830 (/ 1.0 2.0))
(s831 (/ 1.0 2.0))
(s832 (/ 1.0 2.0))
(s833 (/ 1.0 2.0))
(s834 (/ 1.0 2.0))
(s842 (/ 1.0 2.0))
(s843 (/ 1.0 2.0))
(s844 (/ 1.0 2.0))
(s845 (/ 1.0 2.0))
(s846 (/ 1.0 2.0))
(s847 (/ 1.0 2.0))
(s848 (/ 1.0 2.0))
(s849 (/ 1.0 2.0))
(s854 (/ 1.0 2.0))
(s855 (/ 1.0 2.0))
(s856 (/ 1.0 2.0))
(s857 (/ 1.0 2.0))
(s858 (/ 1.0 2.0))
(s859 (/ 1.0 2.0))
(s864 (/ 1.0 2.0))
(s865 (/ 1.0 2.0))
(s866 (/ 1.0 2.0))
(s867 (/ 1.0 2.0))
(s868 (/ 1.0 2.0))
(s869 (/ 1.0 2.0))
(s870 (/ 1.0 2.0))
(s871 (/ 1.0 2.0))
(s876 (/ 1.0 2.0))
(s877 (/ 1.0 2.0))
(s878 (/ 1.0 2.0))
(s879 (/ 1.0 2.0))
(s880 (/ 1.0 2.0))
(s881 (/ 1.0 2.0))
(s882 (/ 1.0 2.0))
(s883 (/ 1.0 2.0))
(s891 (/ 1.0 2.0))
(s892 (/ 1.0 2.0))
(s893 (/ 1.0 2.0))
(s894 (/ 1.0 2.0))
(s895 (/ 1.0 2.0))
(s896 (/ 1.0 2.0))
(s897 (/ 1.0 2.0))
(s898 (/ 1.0 2.0))
(s903 (/ 1.0 2.0))
(s904 (/ 1.0 2.0))
(s905 (/ 1.0 2.0))
(s906 (/ 1.0 2.0))
(s907 (/ 1.0 2.0))
(s908 (/ 1.0 2.0))
(s913 (/ 1.0 2.0))
(s914 (/ 1.0 2.0))
(s915 (/ 1.0 2.0))
(s916 (/ 1.0 2.0))
(s917 (/ 1.0 2.0))
(s918 (/ 1.0 2.0))
(s919 (/ 1.0 2.0))
(s920 (/ 1.0 2.0))
(s925 (/ 1.0 2.0))
(s926 (/ 1.0 2.0))
(s927 (/ 1.0 2.0))
(s928 (/ 1.0 2.0))
(s929 (/ 1.0 2.0))
(s930 (/ 1.0 2.0))
(s931 (/ 1.0 2.0))
(s932 (/ 1.0 2.0))
(s940 (/ 1.0 2.0))
(s941 (/ 1.0 2.0))
(s942 (/ 1.0 2.0))
(s943 (/ 1.0 2.0))
(s944 (/ 1.0 2.0))
(s945 (/ 1.0 2.0))
(s946 (/ 1.0 2.0))
(s947 (/ 1.0 2.0))
(s952 (/ 1.0 2.0))
(s953 (/ 1.0 2.0))
(s954 (/ 1.0 2.0))
(s955 (/ 1.0 2.0))
(s956 (/ 1.0 2.0))
(s957 (/ 1.0 2.0))
(s962 (/ 1.0 2.0))
(s963 (/ 1.0 2.0))
(s964 (/ 1.0 2.0))
(s965 (/ 1.0 2.0))
(s966 (/ 1.0 2.0))
(s967 (/ 1.0 2.0))
(s968 (/ 1.0 2.0))
(s969 (/ 1.0 2.0))
(s974 (/ 1.0 2.0))
(s975 (/ 1.0 2.0))
(s976 (/ 1.0 2.0))
(s977 (/ 1.0 2.0))
(s978 (/ 1.0 2.0))
(s979 (/ 1.0 2.0))
(s980 (/ 1.0 2.0))
(s981 (/ 1.0 2.0))
(s989 (/ 1.0 2.0))
(s990 (/ 1.0 2.0))
(s991 (/ 1.0 2.0))
(s992 (/ 1.0 2.0))
(s993 (/ 1.0 2.0))
(s994 (/ 1.0 2.0))
(s995 (/ 1.0 2.0))
(s996 (/ 1.0 2.0))
(s1001 (/ 1.0 2.0))
(s1002 (/ 1.0 2.0))
(s1003 (/ 1.0 2.0))
(s1004 (/ 1.0 2.0))
(s1005 (/ 1.0 2.0))
(s1006 (/ 1.0 2.0))
(s1011 (/ 1.0 2.0))
(s1012 (/ 1.0 2.0))
(s1013 (/ 1.0 2.0))
(s1014 (/ 1.0 2.0))
(s1015 (/ 1.0 2.0))
(s1016 (/ 1.0 2.0))
(s1017 (/ 1.0 2.0))
(s1018 (/ 1.0 2.0))
(s1023 (/ 1.0 2.0))
(s1024 (/ 1.0 2.0))
(s1025 (/ 1.0 2.0))
(s1026 (/ 1.0 2.0))
(s1027 (/ 1.0 2.0))
(s1028 (/ 1.0 2.0))
(s1029 (/ 1.0 2.0))
(s1030 (/ 1.0 2.0))
(s1038 (/ 1.0 2.0))
(s1039 (/ 1.0 2.0))
(s1040 (/ 1.0 2.0))
(s1041 (/ 1.0 2.0))
(s1042 (/ 1.0 2.0))
(s1043 (/ 1.0 2.0))
(s1044 (/ 1.0 2.0))
(s1045 (/ 1.0 2.0))
(s1050 (/ 1.0 2.0))
(s1051 (/ 1.0 2.0))
(s1052 (/ 1.0 2.0))
(s1053 (/ 1.0 2.0))
(s1054 (/ 1.0 2.0))
(s1055 (/ 1.0 2.0))
(s1060 (/ 1.0 2.0))
(s1061 (/ 1.0 2.0))
(s1062 (/ 1.0 2.0))
(s1063 (/ 1.0 2.0))
(s1064 (/ 1.0 2.0))
(s1065 (/ 1.0 2.0))
(s1066 (/ 1.0 2.0))
(s1067 (/ 1.0 2.0))
(s1072 (/ 1.0 2.0))
(s1073 (/ 1.0 2.0))
(s1074 (/ 1.0 2.0))
(s1075 (/ 1.0 2.0))
(s1076 (/ 1.0 2.0))
(s1077 (/ 1.0 2.0))
(s1078 (/ 1.0 2.0))
(s1079 (/ 1.0 2.0))
(s1087 (/ 1.0 2.0))
(s1088 (/ 1.0 2.0))
(s1089 (/ 1.0 2.0))
(s1090 (/ 1.0 2.0))
(s1091 (/ 1.0 2.0))
(s1092 (/ 1.0 2.0))
(s1093 (/ 1.0 2.0))
(s1094 (/ 1.0 2.0))
(s1099 (/ 1.0 2.0))
(s1100 (/ 1.0 2.0))
(s1101 (/ 1.0 2.0))
(s1102 (/ 1.0 2.0))
(s1103 (/ 1.0 2.0))
(s1104 (/ 1.0 2.0))
(s1109 (/ 1.0 2.0))
(s1110 (/ 1.0 2.0))
(s1111 (/ 1.0 2.0))
(s1112 (/ 1.0 2.0))
(s1113 (/ 1.0 2.0))
(s1114 (/ 1.0 2.0))
(s1115 (/ 1.0 2.0))
(s1116 (/ 1.0 2.0))
(s1121 (/ 1.0 2.0))
(s1122 (/ 1.0 2.0))
(s1123 (/ 1.0 2.0))
(s1124 (/ 1.0 2.0))
(s1125 (/ 1.0 2.0))
(s1126 (/ 1.0 2.0))
(s1127 (/ 1.0 2.0))
(s1128 (/ 1.0 2.0))
(s1136 (/ 1.0 2.0))
(s1137 (/ 1.0 2.0))
(s1138 (/ 1.0 2.0))
(s1139 (/ 1.0 2.0))
(s1140 (/ 1.0 2.0))
(s1141 (/ 1.0 2.0))
(s1142 (/ 1.0 2.0))
(s1143 (/ 1.0 2.0))
(s1148 (/ 1.0 2.0))
(s1149 (/ 1.0 2.0))
(s1150 (/ 1.0 2.0))
(s1151 (/ 1.0 2.0))
(s1152 (/ 1.0 2.0))
(s1153 (/ 1.0 2.0))
(s1158 (/ 1.0 2.0))
(s1159 (/ 1.0 2.0))
(s1160 (/ 1.0 2.0))
(s1161 (/ 1.0 2.0))
(s1162 (/ 1.0 2.0))
(s1163 (/ 1.0 2.0))
(s1164 (/ 1.0 2.0))
(s1165 (/ 1.0 2.0))
(s1170 (/ 1.0 2.0))
(s1171 (/ 1.0 2.0))
(s1172 (/ 1.0 2.0))
(s1173 (/ 1.0 2.0))
(s1174 (/ 1.0 2.0))
(s1175 (/ 1.0 2.0))
(s1176 (/ 1.0 2.0))
(s1177 (/ 1.0 2.0))
(s1185 (/ 1.0 2.0))
(s1186 (/ 1.0 2.0))
(s1187 (/ 1.0 2.0))
(s1188 (/ 1.0 2.0))
(s1189 (/ 1.0 2.0))
(s1190 (/ 1.0 2.0))
(s1191 (/ 1.0 2.0))
(s1192 (/ 1.0 2.0))
(s1197 (/ 1.0 2.0))
(s1198 (/ 1.0 2.0))
(s1199 (/ 1.0 2.0))
(s1200 (/ 1.0 2.0))
(s1201 (/ 1.0 2.0))
(s1202 (/ 1.0 2.0))
(s1207 (/ 1.0 2.0))
(s1208 (/ 1.0 2.0))
(s1209 (/ 1.0 2.0))
(s1210 (/ 1.0 2.0))
(s1211 (/ 1.0 2.0))
(s1212 (/ 1.0 2.0))
(s1213 (/ 1.0 2.0))
(s1214 (/ 1.0 2.0))
(s1219 (/ 1.0 2.0))
(s1220 (/ 1.0 2.0))
(s1221 (/ 1.0 2.0))
(s1222 (/ 1.0 2.0))
(s1223 (/ 1.0 2.0))
(s1224 (/ 1.0 2.0))
(s1225 (/ 1.0 2.0))
(s1226 (/ 1.0 2.0))
(s1234 (/ 1.0 2.0))
(s1235 (/ 1.0 2.0))
(s1236 (/ 1.0 2.0))
(s1237 (/ 1.0 2.0))
(s1238 (/ 1.0 2.0))
(s1239 (/ 1.0 2.0))
(s1240 (/ 1.0 2.0))
(s1241 (/ 1.0 2.0))
(s1246 (/ 1.0 2.0))
(s1247 (/ 1.0 2.0))
(s1248 (/ 1.0 2.0))
(s1249 (/ 1.0 2.0))
(s1250 (/ 1.0 2.0))
(s1251 (/ 1.0 2.0))
(s1256 (/ 1.0 2.0))
(s1257 (/ 1.0 2.0))
(s1258 (/ 1.0 2.0))
(s1259 (/ 1.0 2.0))
(s1260 (/ 1.0 2.0))
(s1261 (/ 1.0 2.0))
(s1262 (/ 1.0 2.0))
(s1263 (/ 1.0 2.0))
(s1268 (/ 1.0 2.0))
(s1269 (/ 1.0 2.0))
(s1270 (/ 1.0 2.0))
(s1271 (/ 1.0 2.0))
(s1272 (/ 1.0 2.0))
(s1273 (/ 1.0 2.0))
(s1274 (/ 1.0 2.0))
(s1275 (/ 1.0 2.0))
(s1283 (/ 1.0 2.0))
(s1284 (/ 1.0 2.0))
(s1285 (/ 1.0 2.0))
(s1286 (/ 1.0 2.0))
(s1287 (/ 1.0 2.0))
(s1288 (/ 1.0 2.0))
(s1289 (/ 1.0 2.0))
(s1290 (/ 1.0 2.0))
(s1295 (/ 1.0 2.0))
(s1296 (/ 1.0 2.0))
(s1297 (/ 1.0 2.0))
(s1298 (/ 1.0 2.0))
(s1299 (/ 1.0 2.0))
(s1300 (/ 1.0 2.0))
(s1305 (/ 1.0 2.0))
(s1306 (/ 1.0 2.0))
(s1307 (/ 1.0 2.0))
(s1308 (/ 1.0 2.0))
(s1309 (/ 1.0 2.0))
(s1310 (/ 1.0 2.0))
(s1311 (/ 1.0 2.0))
(s1312 (/ 1.0 2.0))
(s1317 (/ 1.0 2.0))
(s1318 (/ 1.0 2.0))
(s1319 (/ 1.0 2.0))
(s1320 (/ 1.0 2.0))
(s1321 (/ 1.0 2.0))
(s1322 (/ 1.0 2.0))
(s1323 (/ 1.0 2.0))
(s1324 (/ 1.0 2.0))
(s1332 (/ 1.0 2.0))
(s1333 (/ 1.0 2.0))
(s1334 (/ 1.0 2.0))
(s1335 (/ 1.0 2.0))
(s1336 (/ 1.0 2.0))
(s1337 (/ 1.0 2.0))
(s1338 (/ 1.0 2.0))
(s1339 (/ 1.0 2.0))
(s1344 (/ 1.0 2.0))
(s1345 (/ 1.0 2.0))
(s1346 (/ 1.0 2.0))
(s1347 (/ 1.0 2.0))
(s1348 (/ 1.0 2.0))
(s1349 (/ 1.0 2.0))
(s1354 (/ 1.0 2.0))
(s1355 (/ 1.0 2.0))
(s1356 (/ 1.0 2.0))
(s1357 (/ 1.0 2.0))
(s1358 (/ 1.0 2.0))
(s1359 (/ 1.0 2.0))
(s1360 (/ 1.0 2.0))
(s1361 (/ 1.0 2.0))
(s1366 (/ 1.0 2.0))
(s1367 (/ 1.0 2.0))
(s1368 (/ 1.0 2.0))
(s1369 (/ 1.0 2.0))
(s1370 (/ 1.0 2.0))
(s1371 (/ 1.0 2.0))
(s1372 (/ 1.0 2.0))
(s1373 (/ 1.0 2.0))
(s1381 (/ 1.0 2.0))
(s1382 (/ 1.0 2.0))
(s1383 (/ 1.0 2.0))
(s1384 (/ 1.0 2.0))
(s1385 (/ 1.0 2.0))
(s1386 (/ 1.0 2.0))
(s1387 (/ 1.0 2.0))
(s1388 (/ 1.0 2.0))
(s1393 (/ 1.0 2.0))
(s1394 (/ 1.0 2.0))
(s1395 (/ 1.0 2.0))
(s1396 (/ 1.0 2.0))
(s1397 (/ 1.0 2.0))
(s1398 (/ 1.0 2.0))
(s1403 (/ 1.0 2.0))
(s1404 (/ 1.0 2.0))
(s1405 (/ 1.0 2.0))
(s1406 (/ 1.0 2.0))
(s1407 (/ 1.0 2.0))
(s1408 (/ 1.0 2.0))
(s1409 (/ 1.0 2.0))
(s1410 (/ 1.0 2.0))
(s1415 (/ 1.0 2.0))
(s1416 (/ 1.0 2.0))
(s1417 (/ 1.0 2.0))
(s1418 (/ 1.0 2.0))
(s1419 (/ 1.0 2.0))
(s1420 (/ 1.0 2.0))
(s1421 (/ 1.0 2.0))
(s1422 (/ 1.0 2.0))
(s1430 (/ 1.0 2.0))
(s1431 (/ 1.0 2.0))
(s1432 (/ 1.0 2.0))
(s1433 (/ 1.0 2.0))
(s1434 (/ 1.0 2.0))
(s1435 (/ 1.0 2.0))
(s1436 (/ 1.0 2.0))
(s1437 (/ 1.0 2.0))
(s1442 (/ 1.0 2.0))
(s1443 (/ 1.0 2.0))
(s1444 (/ 1.0 2.0))
(s1445 (/ 1.0 2.0))
(s1446 (/ 1.0 2.0))
(s1447 (/ 1.0 2.0))
(s1452 (/ 1.0 2.0))
(s1453 (/ 1.0 2.0))
(s1454 (/ 1.0 2.0))
(s1455 (/ 1.0 2.0))
(s1456 (/ 1.0 2.0))
(s1457 (/ 1.0 2.0))
(s1458 (/ 1.0 2.0))
(s1459 (/ 1.0 2.0))
(s1464 (/ 1.0 2.0))
(s1465 (/ 1.0 2.0))
(s1466 (/ 1.0 2.0))
(s1467 (/ 1.0 2.0))
(s1468 (/ 1.0 2.0))
(s1469 (/ 1.0 2.0))
(s1470 (/ 1.0 2.0))
(s1471 (/ 1.0 2.0))
(s1479 (/ 1.0 2.0))
(s1480 (/ 1.0 2.0))
(s1481 (/ 1.0 2.0))
(s1482 (/ 1.0 2.0))
(s1483 (/ 1.0 2.0))
(s1484 (/ 1.0 2.0))
(s1485 (/ 1.0 2.0))
(s1486 (/ 1.0 2.0))
(s1491 (/ 1.0 2.0))
(s1492 (/ 1.0 2.0))
(s1493 (/ 1.0 2.0))
(s1494 (/ 1.0 2.0))
(s1495 (/ 1.0 2.0))
(s1496 (/ 1.0 2.0))
(s1501 (/ 1.0 2.0))
(s1502 (/ 1.0 2.0))
(s1503 (/ 1.0 2.0))
(s1504 (/ 1.0 2.0))
(s1505 (/ 1.0 2.0))
(s1506 (/ 1.0 2.0))
(s1507 (/ 1.0 2.0))
(s1508 (/ 1.0 2.0))
(s1513 (/ 1.0 2.0))
(s1514 (/ 1.0 2.0))
(s1515 (/ 1.0 2.0))
(s1516 (/ 1.0 2.0))
(s1517 (/ 1.0 2.0))
(s1518 (/ 1.0 2.0))
(s1519 (/ 1.0 2.0))
(s1520 (/ 1.0 2.0))
(s1528 (/ 1.0 2.0))
(s1529 (/ 1.0 2.0))
(s1530 (/ 1.0 2.0))
(s1531 (/ 1.0 2.0))
(s1532 (/ 1.0 2.0))
(s1533 (/ 1.0 2.0))
(s1534 (/ 1.0 2.0))
(s1535 (/ 1.0 2.0))
(s1540 (/ 1.0 2.0))
(s1541 (/ 1.0 2.0))
(s1542 (/ 1.0 2.0))
(s1543 (/ 1.0 2.0))
(s1544 (/ 1.0 2.0))
(s1545 (/ 1.0 2.0))
(s1550 (/ 1.0 2.0))
(s1551 (/ 1.0 2.0))
(s1552 (/ 1.0 2.0))
(s1553 (/ 1.0 2.0))
(s1554 (/ 1.0 2.0))
(s1555 (/ 1.0 2.0))
(s1556 (/ 1.0 2.0))
(s1557 (/ 1.0 2.0))
(s1562 (/ 1.0 2.0))
(s1563 (/ 1.0 2.0))
(s1564 (/ 1.0 2.0))
(s1565 (/ 1.0 2.0))
(s1566 (/ 1.0 2.0))
(s1567 (/ 1.0 2.0))
(s1568 (/ 1.0 2.0))
(s1569 (/ 1.0 2.0))
(s1577 (/ 1.0 2.0))
(s1578 (/ 1.0 2.0))
(s1579 (/ 1.0 2.0))
(s1580 (/ 1.0 2.0))
(s1581 (/ 1.0 2.0))
(s1582 (/ 1.0 2.0))
(s1583 (/ 1.0 2.0))
(s1584 (/ 1.0 2.0))
(s1589 (/ 1.0 2.0))
(s1590 (/ 1.0 2.0))
(s1591 (/ 1.0 2.0))
(s1592 (/ 1.0 2.0))
(s1593 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1166 variables, 1166/1166 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1166/5006 variables, and 1166 constraints, problems are : Problem set: 0 solved, 1166 unsolved in 5100 ms.
Refiners :[Domain max(s): 1166/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 1166/1166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1166 variables, 1166/1166 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1166/5006 variables, and 1166 constraints, problems are : Problem set: 0 solved, 1166 unsolved in 5027 ms.
Refiners :[Domain max(s): 1166/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 0/1166 constraints, Known Traps: 0/0 constraints]
After SMT, in 10629ms problems are : Problem set: 0 solved, 1166 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1166 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 492 place count 2503 transition count 2011
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 494 rules applied. Total rules applied 986 place count 2011 transition count 2009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 987 place count 2010 transition count 2009
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 987 place count 2010 transition count 1962
Deduced a syphon composed of 47 places in 7 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1081 place count 1963 transition count 1962
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1154 place count 1890 transition count 1889
Iterating global reduction 3 with 73 rules applied. Total rules applied 1227 place count 1890 transition count 1889
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1227 place count 1890 transition count 1860
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1285 place count 1861 transition count 1860
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 415
Deduced a syphon composed of 415 places in 13 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 3 with 830 rules applied. Total rules applied 2115 place count 1446 transition count 1445
Renaming transitions due to excessive name length > 1024 char.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 2177 place count 1415 transition count 1471
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2178 place count 1415 transition count 1470
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2179 place count 1415 transition count 1469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2180 place count 1414 transition count 1469
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2181 place count 1414 transition count 1468
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2182 place count 1414 transition count 1468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2183 place count 1413 transition count 1467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2184 place count 1412 transition count 1467
Applied a total of 2184 rules in 635 ms. Remains 1412 /2503 variables (removed 1091) and now considering 1467/2503 (removed 1036) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 1412/2503 places, 1467/2503 transitions.
RANDOM walk for 2357491 steps (578 resets) in 120011 ms. (19 steps per ms) remains 627/1166 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 627/627 properties
// Phase 1: matrix 1467 rows 1412 cols
[2024-05-28 17:31:25] [INFO ] Computed 200 invariants in 5 ms
[2024-05-28 17:31:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 108/735 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (OVERLAPS) 737/1472 variables, 735/822 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1472/2879 variables, and 822 constraints, problems are : Problem set: 0 solved, 627 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 87/200 constraints, State Equation: 735/1412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 108/735 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 21 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:32:16] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:32:17] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 3 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:32:18] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:32:19] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:32:20] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:32:20] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:32:20] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 3 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:32:21] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:32:22] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:32:23] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 4 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 3 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:32:24] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:32:25] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 6 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-28 17:32:26] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:32:27] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:32:27] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:32:27] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:32:28] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:29] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:32:29] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:30] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 3 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:31] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 4 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:32:32] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:32:33] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:34] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:34] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:32:35] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:32:35] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:32:36] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:32:36] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:32:36] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:32:36] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 3 ms to minimize.
[2024-05-28 17:32:36] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:32:37] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:32:37] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-28 17:32:38] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:32:38] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:32:38] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:32:39] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:32:39] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:32:39] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:32:39] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-28 17:32:39] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:32:40] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:42] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:32:42] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:32:42] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:42] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:32:42] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 5 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:32:43] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:32:44] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-05-28 17:32:46] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:32:47] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:49] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:32:49] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:32:50] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:32:51] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:32:52] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:32:52] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:32:52] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-05-28 17:32:52] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:32:52] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:32:52] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 3 ms to minimize.
[2024-05-28 17:32:53] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:32:53] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-28 17:32:53] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-05-28 17:32:53] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-05-28 17:32:55] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:32:55] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/2879 variables, and 209 constraints, problems are : Problem set: 0 solved, 627 unsolved in 45034 ms.
Refiners :[Positive P Invariants (semi-flows): 87/200 constraints, State Equation: 0/1412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/627 constraints, Known Traps: 122/122 constraints]
After SMT, in 90219ms problems are : Problem set: 0 solved, 627 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 627 out of 1412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1412/1412 places, 1467/1467 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 1412 transition count 1324
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 1269 transition count 1324
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 286 place count 1269 transition count 1253
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 428 place count 1198 transition count 1253
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 478 place count 1148 transition count 1203
Iterating global reduction 2 with 50 rules applied. Total rules applied 528 place count 1148 transition count 1203
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 528 place count 1148 transition count 1153
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 628 place count 1098 transition count 1153
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 824 place count 1000 transition count 1055
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 932 place count 946 transition count 1109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 934 place count 946 transition count 1107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 936 place count 944 transition count 1107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 937 place count 944 transition count 1106
Applied a total of 937 rules in 192 ms. Remains 944 /1412 variables (removed 468) and now considering 1106/1467 (removed 361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 944/1412 places, 1106/1467 transitions.
RANDOM walk for 2909436 steps (725 resets) in 120012 ms. (24 steps per ms) remains 562/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 562/562 properties
// Phase 1: matrix 1106 rows 944 cols
[2024-05-28 17:33:26] [INFO ] Computed 200 invariants in 5 ms
[2024-05-28 17:33:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 128/690 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/690 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 699/1389 variables, 690/773 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1389 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (OVERLAPS) 52/1441 variables, 23/796 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1441 variables, 5/801 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t3 0.0)
(t4 0.0)
(t5 (/ 11.0 86.0))
(t6 0.0)
(t7 0.0)
(t10 1.0)
(t11 1.0)
(t14 0.0)
(t15 (/ 3.0 86.0))
(t16 (/ 3.0 86.0))
(t17 (/ 1.0 43.0))
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 (/ 3.0 86.0))
(t22 (/ 11.0 86.0))
(t25 1.0)
(t26 0.0)
(t28 0.0)
(t29 0.0)
(t30 (/ 11.0 86.0))
(t31 (/ 11.0 86.0))
(t32 (/ 11.0 86.0))
(t33 (/ 11.0 86.0))
(t34 (/ 11.0 86.0))
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 1.0)
(t39 (/ 3.0 86.0))
(t40 (/ 1.0 43.0))
(t41 0.0)
(t42 (/ 83.0 86.0))
(t43 0.0)
(t44 (/ 4.0 43.0))
(t45 (/ 4.0 43.0))
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 (/ 4.0 43.0))
(t50 0.0)
(t51 0.0)
(t52 (/ 11.0 86.0))
(t53 (/ 11.0 86.0))
(t54 (/ 5.0 43.0))
(t55 (/ 5.0 43.0))
(t56 0.0)
(t57 (/ 1.0 86.0))
(t58 0.0)
(t59 0.0)
(t60 (/ 11.0 86.0))
(t61 (/ 10.0 43.0))
(t62 (/ 10.0 43.0))
(t63 (/ 19.0 86.0))
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 (/ 9.0 86.0))
(t68 (/ 5.0 43.0))
(t69 (/ 9.0 86.0))
(t70 (/ 9.0 86.0))
(t71 0.0)
(t72 (/ 1.0 86.0))
(t73 0.0)
(t74 0.0)
(t75 (/ 9.0 86.0))
(t76 (/ 4.0 43.0))
(t77 (/ 4.0 43.0))
(t78 (/ 4.0 43.0))
(t79 (/ 1.0 86.0))
(t80 0.0)
(t81 (/ 9.0 86.0))
(t82 (/ 17.0 86.0))
(t83 (/ 8.0 43.0))
(t84 (/ 7.0 43.0))
(t85 (/ 13.0 86.0))
(t86 0.0)
(t87 (/ 1.0 86.0))
(t88 0.0)
(t89 0.0)
(t90 (/ 17.0 86.0))
(t91 (/ 5.0 86.0))
(t92 (/ 3.0 86.0))
(t93 (/ 1.0 43.0))
(t94 0.0)
(t95 (/ 1.0 86.0))
(t96 0.0)
(t97 (/ 3.0 43.0))
(t98 (/ 11.0 86.0))
(t99 (/ 9.0 86.0))
(t100 (/ 4.0 43.0))
(t101 0.0)
(t102 (/ 1.0 86.0))
(t103 0.0)
(t104 0.0)
(t105 (/ 5.0 86.0))
(t106 (/ 3.0 86.0))
(t107 (/ 1.0 43.0))
(t108 0.0)
(t109 (/ 1.0 86.0))
(t110 0.0)
(t111 (/ 3.0 43.0))
(t112 0.0)
(t113 (/ 6.0 43.0))
(t114 (/ 6.0 43.0))
(t115 (/ 6.0 43.0))
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 (/ 6.0 43.0))
(t120 0.0)
(t121 (/ 5.0 86.0))
(t122 (/ 3.0 86.0))
(t123 (/ 1.0 43.0))
(t124 0.0)
(t125 (/ 1.0 86.0))
(t126 0.0)
(t127 (/ 3.0 43.0))
(t128 (/ 11.0 86.0))
(t129 (/ 9.0 86.0))
(t130 (/ 4.0 43.0))
(t131 (/ 3.0 43.0))
(t132 (/ 1.0 86.0))
(t133 0.0)
(t134 (/ 11.0 86.0))
(t135 (/ 5.0 43.0))
(t136 (/ 3.0 86.0))
(t137 (/ 1.0 43.0))
(t138 0.0)
(t139 (/ 3.0 43.0))
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 (/ 11.0 86.0))
(t144 (/ 9.0 86.0))
(t145 (/ 4.0 43.0))
(t146 0.0)
(t147 (/ 1.0 86.0))
(t148 0.0)
(t149 (/ 11.0 86.0))
(t150 0.0)
(t151 (/ 5.0 86.0))
(t152 (/ 3.0 86.0))
(t153 (/ 1.0 43.0))
(t154 0.0)
(t155 (/ 1.0 86.0))
(t156 0.0)
(t157 (/ 3.0 43.0))
(t158 (/ 7.0 86.0))
(t159 (/ 7.0 86.0))
(t160 (/ 7.0 86.0))
(t161 (/ 3.0 43.0))
(t162 0.0)
(t163 0.0)
(t164 (/ 11.0 86.0))
(t165 (/ 8.0 43.0))
(t166 (/ 7.0 43.0))
(t167 (/ 13.0 86.0))
(t168 0.0)
(t169 (/ 1.0 86.0))
(t170 0.0)
(t171 (/ 3.0 43.0))
(t172 0.0)
(t173 (/ 8.0 43.0))
(t174 (/ 7.0 43.0))
(t175 (/ 13.0 86.0))
(t176 0.0)
(t177 (/ 1.0 86.0))
(t178 0.0)
(t179 (/ 17.0 86.0))
(t180 0.0)
(t181 (/ 6.0 43.0))
(t182 (/ 6.0 43.0))
(t183 (/ 6.0 43.0))
(t184 (/ 11.0 86.0))
(t185 0.0)
(t186 0.0)
(t187 (/ 6.0 43.0))
(t188 (/ 6.0 43.0))
(t189 (/ 6.0 43.0))
(t190 (/ 6.0 43.0))
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 (/ 17.0 86.0))
(t195 (/ 8.0 43.0))
(t196 (/ 7.0 43.0))
(t197 (/ 13.0 86.0))
(t198 0.0)
(t199 (/ 1.0 86.0))
(t200 0.0)
(t201 0.0)
(t202 (/ 6.0 43.0))
(t203 (/ 11.0 43.0))
(t204 (/ 10.0 43.0))
(t205 (/ 19.0 86.0))
(t206 0.0)
(t207 (/ 1.0 86.0))
(t208 0.0)
(t209 (/ 11.0 86.0))
(t210 0.0)
(t211 (/ 11.0 86.0))
(t212 (/ 9.0 86.0))
(t213 (/ 4.0 43.0))
(t214 (/ 3.0 43.0))
(t215 (/ 1.0 86.0))
(t216 0.0)
(t217 (/ 6.0 43.0))
(t218 (/ 17.0 86.0))
(t219 (/ 15.0 86.0))
(t220 (/ 7.0 43.0))
(t221 (/ 6.0 43.0))
(t222 (/ 1.0 86.0))
(t223 0.0)
(t224 (/ 11.0 86.0))
(t225 (/ 11.0 43.0))
(t226 (/ 10.0 43.0))
(t227 (/ 19.0 86.0))
(t228 0.0)
(t229 (/ 1.0 86.0))
(t230 0.0)
(t231 (/ 6.0 43.0))
(t232 (/ 3.0 43.0))
(t233 (/ 5.0 43.0))
(t234 (/ 4.0 43.0))
(t235 (/ 7.0 86.0))
(t236 0.0)
(t237 (/ 1.0 86.0))
(t238 0.0)
(t239 (/ 5.0 86.0))
(t240 (/ 3.0 43.0))
(t241 (/ 5.0 86.0))
(t242 (/ 3.0 86.0))
(t243 (/ 1.0 43.0))
(t244 0.0)
(t245 (/ 1.0 86.0))
(t246 0.0)
(t247 0.0)
(t248 (/ 5.0 86.0))
(t249 (/ 3.0 86.0))
(t250 (/ 1.0 43.0))
(t251 0.0)
(t252 (/ 1.0 86.0))
(t253 0.0)
(t254 (/ 17.0 86.0))
(t255 (/ 8.0 43.0))
(t256 (/ 7.0 43.0))
(t257 (/ 13.0 86.0))
(t258 0.0)
(t259 (/ 1.0 86.0))
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 (/ 8.0 43.0))
(t264 (/ 7.0 43.0))
(t265 (/ 13.0 86.0))
(t266 0.0)
(t267 (/ 1.0 86.0))
(t268 0.0)
(t269 (/ 17.0 86.0))
(t270 0.0)
(t271 (/ 5.0 86.0))
(t272 (/ 3.0 86.0))
(t273 (/ 1.0 43.0))
(t274 0.0)
(t275 (/ 1.0 86.0))
(t276 0.0)
(t277 (/ 3.0 43.0))
(t278 (/ 11.0 86.0))
(t279 (/ 9.0 86.0))
(t280 (/ 4.0 43.0))
(t281 (/ 3.0 43.0))
(t282 (/ 1.0 86.0))
(t283 0.0)
(t284 (/ 17.0 86.0))
(t285 (/ 11.0 43.0))
(t286 (/ 10.0 43.0))
(t287 (/ 19.0 86.0))
(t288 0.0)
(t289 (/ 1.0 86.0))
(t290 0.0)
(t291 (/ 3.0 43.0))
(t292 0.0)
(t293 (/ 8.0 43.0))
(t294 (/ 7.0 43.0))
(t295 (/ 13.0 86.0))
(t296 0.0)
(t297 (/ 1.0 86.0))
(t298 0.0)
(t299 (/ 17.0 86.0))
(t300 0.0)
(t301 (/ 5.0 86.0))
(t302 (/ 3.0 86.0))
(t303 (/ 1.0 43.0))
(t304 0.0)
(t305 (/ 1.0 86.0))
(t306 0.0)
(t307 (/ 3.0 43.0))
(t308 (/ 11.0 86.0))
(t309 (/ 9.0 86.0))
(t310 (/ 4.0 43.0))
(t311 0.0)
(t312 (/ 1.0 86.0))
(t313 0.0)
(t314 (/ 17.0 86.0))
(t315 (/ 11.0 43.0))
(t316 (/ 10.0 43.0))
(t317 (/ 19.0 86.0))
(t318 0.0)
(t319 (/ 1.0 86.0))
(t320 0.0)
(t321 (/ 3.0 43.0))
(t322 0.0)
(t323 (/ 11.0 43.0))
(t324 (/ 10.0 43.0))
(t325 (/ 19.0 86.0))
(t326 0.0)
(t327 (/ 1.0 86.0))
(t328 0.0)
(t329 (/ 23.0 86.0))
(t330 0.0)
(t331 (/ 11.0 86.0))
(t332 (/ 9.0 86.0))
(t333 (/ 4.0 43.0))
(t334 0.0)
(t335 (/ 1.0 86.0))
(t336 0.0)
(t337 (/ 6.0 43.0))
(t338 (/ 17.0 86.0))
(t339 (/ 15.0 86.0))
(t340 (/ 7.0 43.0))
(t341 (/ 6.0 43.0))
(t342 (/ 1.0 86.0))
(t343 0.0)
(t344 (/ 23.0 86.0))
(t345 (/ 11.0 43.0))
(t346 (/ 10.0 43.0))
(t347 (/ 19.0 86.0))
(t348 0.0)
(t349 (/ 1.0 86.0))
(t350 0.0)
(t351 (/ 6.0 43.0))
(t352 (/ 3.0 43.0))
(t353 (/ 5.0 43.0))
(t354 (/ 4.0 43.0))
(t355 (/ 7.0 86.0))
(t356 0.0)
(t357 (/ 1.0 86.0))
(t358 0.0)
(t359 (/ 5.0 86.0))
(t360 (/ 3.0 43.0))
(t361 (/ 5.0 86.0))
(t362 (/ 3.0 86.0))
(t363 (/ 1.0 43.0))
(t364 0.0)
(t365 (/ 1.0 86.0))
(t366 0.0)
(t367 0.0)
(t368 (/ 5.0 86.0))
(t369 (/ 3.0 86.0))
(t370 (/ 1.0 43.0))
(t371 0.0)
(t372 (/ 1.0 86.0))
(t373 0.0)
(t374 (/ 29.0 86.0))
(t375 (/ 14.0 43.0))
(t376 (/ 13.0 43.0))
(t377 (/ 25.0 86.0))
(t378 0.0)
(t379 (/ 1.0 86.0))
(t380 0.0)
(t381 0.0)
(t382 0.0)
(t383 (/ 11.0 43.0))
(t384 (/ 10.0 43.0))
(t385 (/ 19.0 86.0))
(t386 0.0)
(t387 (/ 1.0 86.0))
(t388 0.0)
(t389 (/ 23.0 86.0))
(t390 0.0)
(t391 (/ 11.0 86.0))
(t392 (/ 9.0 86.0))
(t393 (/ 4.0 43.0))
(t394 0.0)
(t395 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1441/2050 variables, and 801 constraints, problems are : Problem set: 0 solved, 562 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/200 constraints, State Equation: 713/944 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 128/690 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:34:46] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:34:46] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:34:46] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:34:46] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:34:47] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:34:47] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:34:47] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:34:47] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:34:48] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:34:48] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:34:48] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:34:48] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:34:48] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:34:49] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:34:49] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:34:49] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:34:49] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:34:49] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:34:50] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:34:50] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/690 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:34:51] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:34:51] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:34:51] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:34:51] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:34:51] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-28 17:34:52] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:34:52] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-28 17:34:52] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:34:52] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:34:53] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:34:53] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:34:54] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:34:54] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:34:54] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:34:54] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:34:54] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:34:55] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/690 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:34:57] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:34:58] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:34:58] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:34:59] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:35:00] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
[2024-05-28 17:35:00] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:35:01] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:35:01] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 3 ms to minimize.
[2024-05-28 17:35:01] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 3 ms to minimize.
[2024-05-28 17:35:01] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:03] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:03] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:04] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:35:05] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:06] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:35:06] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:35:07] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:07] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:35:09] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:35:09] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:35:09] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:35:10] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-28 17:35:10] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 3 ms to minimize.
[2024-05-28 17:35:11] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-28 17:35:11] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:35:11] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:35:11] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:35:12] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-05-28 17:35:12] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-28 17:35:12] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-28 17:35:12] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-28 17:35:13] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
[2024-05-28 17:35:13] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:35:13] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:13] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:35:16] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:16] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:35:16] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:16] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:35:16] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 3 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:17] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:35:18] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:35:19] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:19] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:19] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/690 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 17:35:20] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:35:21] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-28 17:35:21] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:35:21] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:35:21] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 3 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 5 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 4 ms to minimize.
[2024-05-28 17:35:22] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:35:23] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:35:23] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:35:23] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:35:23] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:35:23] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:35:25] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:35:26] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:35:26] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:35:26] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:26] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:35:27] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:35:28] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:35:28] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:31] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:35:31] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:35:31] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:31] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:35:31] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:35:31] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 3 ms to minimize.
[2024-05-28 17:35:32] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:35:33] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:35:33] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:35:33] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:35:33] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:35:33] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:35:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-28 17:35:36] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:35:36] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:35:36] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:35:37] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 3 ms to minimize.
[2024-05-28 17:35:38] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:40] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:35:40] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:35:41] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:35:41] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:42] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:35:42] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 3 ms to minimize.
[2024-05-28 17:35:42] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:35:42] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:35:43] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
[2024-05-28 17:35:43] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:35:43] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:43] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:35:43] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:35:44] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:46] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:35:46] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:46] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:35:46] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:35:46] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:35:47] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:35:48] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:35:48] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:35:48] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:35:48] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/690 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:49] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:35:49] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:35:50] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:35:50] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:35:50] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:50] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:35:50] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:51] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:35:51] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:35:51] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:35:51] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:35:52] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/690 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/2050 variables, and 350 constraints, problems are : Problem set: 0 solved, 562 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 83/200 constraints, State Equation: 0/944 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/562 constraints, Known Traps: 267/267 constraints]
After SMT, in 150148ms problems are : Problem set: 0 solved, 562 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 562 out of 944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 944/944 places, 1106/1106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 944 transition count 1091
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 929 transition count 1091
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 929 transition count 1081
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 919 transition count 1081
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 916 transition count 1078
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 916 transition count 1078
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 916 transition count 1075
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 913 transition count 1075
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 897 transition count 1059
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 893 transition count 1061
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 893 transition count 1057
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 889 transition count 1057
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 889 transition count 1057
Applied a total of 111 rules in 83 ms. Remains 889 /944 variables (removed 55) and now considering 1057/1106 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 889/944 places, 1057/1106 transitions.
RANDOM walk for 3258719 steps (825 resets) in 120004 ms. (27 steps per ms) remains 555/562 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 555/555 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 555/555 properties
Probabilistic random walk after 1000001 steps, saw 693395 distinct states, run finished after 47095 ms. (steps per millisecond=21 ) properties seen :6
// Phase 1: matrix 1057 rows 889 cols
[2024-05-28 17:37:14] [INFO ] Computed 200 invariants in 4 ms
[2024-05-28 17:37:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 82/631 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/631 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 632/1263 variables, 631/708 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (OVERLAPS) 19/1282 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1282 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (OVERLAPS) 3/1285 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 549 unsolved
SMT process timed out in 90106ms, After SMT, problems are : Problem set: 0 solved, 549 unsolved
Fused 549 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 549 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 1057/1057 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 889 transition count 1052
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 884 transition count 1052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 884 transition count 1051
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 883 transition count 1051
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 877 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 876 transition count 1047
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 876 transition count 1046
Applied a total of 27 rules in 49 ms. Remains 876 /889 variables (removed 13) and now considering 1046/1057 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 876/889 places, 1046/1057 transitions.
RANDOM walk for 1794781 steps (457 resets) in 120004 ms. (14 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 549/549 properties
Probabilistic random walk after 1000001 steps, saw 708396 distinct states, run finished after 46174 ms. (steps per millisecond=21 ) properties seen :3
// Phase 1: matrix 1046 rows 876 cols
[2024-05-28 17:40:01] [INFO ] Computed 200 invariants in 4 ms
[2024-05-28 17:40:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 81/627 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 629/1256 variables, 627/703 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1256 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (OVERLAPS) 21/1277 variables, 8/711 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1277 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1277 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 8 (OVERLAPS) 1/1278 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1278 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1278 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 (/ 133.0 276.0))
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 (/ 11.0 138.0))
(t7 (/ 5.0 69.0))
(t8 (/ 4.0 69.0))
(t9 (/ 7.0 138.0))
(t10 0.0)
(t11 (/ 1.0 138.0))
(t12 0.0)
(t13 0.0)
(t14 (/ 43.0 92.0))
(t15 (/ 127.0 276.0))
(t16 (/ 41.0 92.0))
(t17 (/ 121.0 276.0))
(t18 0.0)
(t19 (/ 1.0 138.0))
(t20 0.0)
(t21 0.0)
(t22 (/ 5.0 138.0))
(t23 (/ 1.0 46.0))
(t24 (/ 1.0 69.0))
(t25 0.0)
(t26 (/ 1.0 138.0))
(t27 0.0)
(t28 (/ 1.0 138.0))
(t29 (/ 1.0 138.0))
(t30 (/ 1.0 138.0))
(t31 (/ 1.0 138.0))
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 (/ 17.0 138.0))
(t37 (/ 8.0 69.0))
(t38 (/ 7.0 69.0))
(t39 (/ 13.0 138.0))
(t40 0.0)
(t41 (/ 1.0 138.0))
(t42 0.0)
(t43 0.0)
(t44 (/ 39.0 92.0))
(t45 (/ 5.0 12.0))
(t46 (/ 37.0 92.0))
(t47 (/ 109.0 276.0))
(t48 0.0)
(t49 (/ 1.0 138.0))
(t50 0.0)
(t51 0.0)
(t52 (/ 11.0 138.0))
(t53 (/ 3.0 46.0))
(t54 (/ 4.0 69.0))
(t55 0.0)
(t56 (/ 1.0 138.0))
(t57 0.0)
(t58 0.0)
(t59 (/ 5.0 138.0))
(t60 (/ 1.0 46.0))
(t61 (/ 1.0 69.0))
(t62 0.0)
(t63 (/ 1.0 138.0))
(t64 0.0)
(t65 (/ 1.0 23.0))
(t66 (/ 35.0 92.0))
(t67 (/ 8.0 69.0))
(t68 (/ 7.0 69.0))
(t69 (/ 13.0 138.0))
(t70 (/ 11.0 138.0))
(t71 (/ 1.0 138.0))
(t72 0.0)
(t73 0.0)
(t74 (/ 35.0 92.0))
(t75 (/ 103.0 276.0))
(t76 (/ 33.0 92.0))
(t77 (/ 97.0 276.0))
(t78 0.0)
(t79 (/ 1.0 138.0))
(t80 0.0)
(t81 0.0)
(t82 (/ 11.0 138.0))
(t83 (/ 3.0 46.0))
(t84 (/ 4.0 69.0))
(t85 0.0)
(t86 (/ 1.0 138.0))
(t87 0.0)
(t88 0.0)
(t89 (/ 5.0 138.0))
(t90 (/ 1.0 46.0))
(t91 (/ 1.0 69.0))
(t92 0.0)
(t93 (/ 1.0 138.0))
(t94 0.0)
(t95 (/ 1.0 23.0))
(t96 (/ 31.0 92.0))
(t97 (/ 91.0 276.0))
(t98 (/ 4.0 69.0))
(t99 (/ 7.0 138.0))
(t100 0.0)
(t101 (/ 1.0 138.0))
(t102 0.0)
(t103 0.0)
(t104 (/ 31.0 92.0))
(t105 (/ 91.0 276.0))
(t106 (/ 29.0 92.0))
(t107 (/ 85.0 276.0))
(t108 0.0)
(t109 (/ 1.0 138.0))
(t110 0.0)
(t111 0.0)
(t112 (/ 5.0 138.0))
(t113 (/ 1.0 46.0))
(t114 (/ 1.0 69.0))
(t115 0.0)
(t116 (/ 1.0 138.0))
(t117 0.0)
(t118 (/ 1.0 138.0))
(t119 (/ 1.0 138.0))
(t120 (/ 1.0 138.0))
(t121 (/ 1.0 138.0))
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 (/ 27.0 92.0))
(t127 (/ 5.0 69.0))
(t128 (/ 4.0 69.0))
(t129 (/ 7.0 138.0))
(t130 0.0)
(t131 (/ 1.0 138.0))
(t132 0.0)
(t133 0.0)
(t134 (/ 27.0 92.0))
(t135 (/ 79.0 276.0))
(t136 (/ 25.0 92.0))
(t137 (/ 73.0 276.0))
(t138 0.0)
(t139 (/ 1.0 138.0))
(t140 0.0)
(t141 0.0)
(t142 (/ 5.0 138.0))
(t143 (/ 1.0 46.0))
(t144 (/ 1.0 69.0))
(t145 0.0)
(t146 (/ 1.0 138.0))
(t147 0.0)
(t148 (/ 1.0 23.0))
(t149 (/ 5.0 138.0))
(t150 (/ 1.0 46.0))
(t151 (/ 1.0 69.0))
(t152 0.0)
(t153 (/ 1.0 138.0))
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 (/ 5.0 69.0))
(t158 (/ 4.0 69.0))
(t159 (/ 7.0 138.0))
(t160 0.0)
(t161 (/ 1.0 138.0))
(t162 0.0)
(t163 (/ 2.0 23.0))
(t164 (/ 1.0 4.0))
(t165 (/ 67.0 276.0))
(t166 (/ 21.0 92.0))
(t167 (/ 61.0 276.0))
(t168 0.0)
(t169 (/ 1.0 138.0))
(t170 0.0)
(t171 0.0)
(t172 (/ 5.0 138.0))
(t173 (/ 1.0 46.0))
(t174 (/ 1.0 69.0))
(t175 0.0)
(t176 (/ 1.0 138.0))
(t177 0.0)
(t178 (/ 2.0 23.0))
(t179 (/ 11.0 138.0))
(t180 (/ 3.0 46.0))
(t181 (/ 4.0 69.0))
(t182 0.0)
(t183 (/ 1.0 138.0))
(t184 0.0)
(t185 0.0)
(t186 (/ 19.0 92.0))
(t187 (/ 55.0 276.0))
(t188 (/ 17.0 92.0))
(t189 (/ 49.0 276.0))
(t190 0.0)
(t191 (/ 1.0 138.0))
(t192 0.0)
(t193 0.0)
(t194 (/ 19.0 92.0))
(t195 (/ 15.0 46.0))
(t196 (/ 43.0 138.0))
(t197 (/ 7.0 23.0))
(t198 0.0)
(t199 (/ 1.0 138.0))
(t200 0.0)
(t201 (/ 35.0 276.0))
(t202 (/ 15.0 92.0))
(t203 (/ 41.0 276.0))
(t204 (/ 13.0 92.0))
(t205 0.0)
(t206 (/ 1.0 138.0))
(t207 0.0)
(t208 0.0)
(t209 (/ 11.0 92.0))
(t210 (/ 5.0 46.0))
(t211 (/ 7.0 69.0))
(t212 0.0)
(t213 (/ 1.0 276.0))
(t214 0.0)
(t215 (/ 35.0 276.0))
(t216 (/ 11.0 138.0))
(t217 (/ 5.0 69.0))
(t218 (/ 4.0 69.0))
(t219 (/ 7.0 138.0))
(t220 0.0)
(t221 (/ 1.0 138.0))
(t222 0.0)
(t223 0.0)
(t224 (/ 20.0 69.0))
(t225 (/ 13.0 46.0))
(t226 (/ 37.0 138.0))
(t227 (/ 6.0 23.0))
(t228 0.0)
(t229 (/ 1.0 138.0))
(t230 0.0)
(t231 0.0)
(t232 (/ 5.0 138.0))
(t233 (/ 1.0 46.0))
(t234 (/ 1.0 69.0))
(t235 0.0)
(t236 (/ 1.0 138.0))
(t237 0.0)
(t238 (/ 1.0 138.0))
(t239 (/ 1.0 138.0))
(t240 (/ 1.0 138.0))
(t241 (/ 1.0 138.0))
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 (/ 17.0 69.0))
(t247 (/ 8.0 69.0))
(t248 (/ 7.0 69.0))
(t249 (/ 13.0 138.0))
(t250 0.0)
(t251 (/ 1.0 138.0))
(t252 0.0)
(t253 0.0)
(t254 (/ 17.0 69.0))
(t255 (/ 13.0 46.0))
(t256 (/ 37.0 138.0))
(t257 (/ 6.0 23.0))
(t258 (/ 17.0 69.0))
(t259 (/ 1.0 138.0))
(t260 0.0)
(t261 (/ 1.0 23.0))
(t262 (/ 11.0 138.0))
(t263 (/ 3.0 46.0))
(t264 (/ 4.0 69.0))
(t265 (/ 1.0 23.0))
(t266 (/ 1.0 138.0))
(t267 0.0)
(t268 0.0)
(t269 (/ 5.0 138.0))
(t270 (/ 1.0 46.0))
(t271 (/ 1.0 69.0))
(t272 0.0)
(t273 (/ 1.0 138.0))
(t274 0.0)
(t275 (/ 1.0 23.0))
(t276 (/ 17.0 69.0))
(t277 (/ 43.0 138.0))
(t278 (/ 41.0 138.0))
(t279 (/ 20.0 69.0))
(t280 0.0)
(t281 (/ 1.0 138.0))
(t282 0.0)
(t283 (/ 5.0 69.0))
(t284 0.0)
(t285 (/ 16.0 69.0))
(t286 (/ 5.0 23.0))
(t287 (/ 29.0 138.0))
(t288 0.0)
(t289 (/ 1.0 138.0))
(t290 0.0)
(t291 (/ 11.0 46.0))
(t292 timeout
(/ 19.0 69.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 105113ms, After SMT, problems are : Problem set: 0 solved, 546 unsolved
Fused 546 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 546 out of 876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 876/876 places, 1046/1046 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 876 transition count 1044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 874 transition count 1044
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 873 transition count 1044
Applied a total of 6 rules in 24 ms. Remains 873 /876 variables (removed 3) and now considering 1044/1046 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 873/876 places, 1044/1046 transitions.
RANDOM walk for 1738957 steps (495 resets) in 120004 ms. (14 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 546/546 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 546/546 properties
Probabilistic random walk after 1000001 steps, saw 719703 distinct states, run finished after 47725 ms. (steps per millisecond=20 ) properties seen :12
// Phase 1: matrix 1044 rows 873 cols
[2024-05-28 17:43:05] [INFO ] Computed 200 invariants in 4 ms
[2024-05-28 17:43:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 87/621 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 626/1247 variables, 621/696 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1247 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (OVERLAPS) 26/1273 variables, 12/708 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 5/713 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 8 (OVERLAPS) 19/1292 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1292 variables, 4/725 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1292 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 11 (OVERLAPS) 21/1313 variables, 8/733 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 120094ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 534 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 1044/1044 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 873 transition count 1042
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 871 transition count 1042
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 871 transition count 1039
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 868 transition count 1039
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 865 transition count 1036
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 863 transition count 1037
Applied a total of 20 rules in 36 ms. Remains 863 /873 variables (removed 10) and now considering 1037/1044 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 863/873 places, 1037/1044 transitions.
RANDOM walk for 1815269 steps (499 resets) in 120004 ms. (15 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (9 resets) in 42 ms. (93 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 534/534 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 534/534 properties
Probabilistic random walk after 1000001 steps, saw 720656 distinct states, run finished after 45548 ms. (steps per millisecond=21 ) properties seen :12
// Phase 1: matrix 1037 rows 863 cols
[2024-05-28 17:46:21] [INFO ] Computed 200 invariants in 2 ms
[2024-05-28 17:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 91/613 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 620/1233 variables, 613/688 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 23/1256 variables, 10/698 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1256 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1256 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 19/1275 variables, 8/711 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1275 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1275 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 11 (OVERLAPS) 21/1296 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1296 variables, 4/727 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1296/1900 variables, and 727 constraints, problems are : Problem set: 0 solved, 522 unsolved in 135016 ms.
Refiners :[Positive P Invariants (semi-flows): 88/200 constraints, State Equation: 639/863 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 91/613 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:48:42] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:48:42] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:48:42] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-28 17:48:42] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:48:42] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:48:42] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:48:43] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:48:44] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:48:44] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:48:44] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:48:44] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 4 ms to minimize.
[2024-05-28 17:48:45] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 3 ms to minimize.
[2024-05-28 17:48:45] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 3 ms to minimize.
[2024-05-28 17:48:45] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-28 17:48:46] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:48:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:48:47] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:48:47] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:48:47] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:48:48] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:48:48] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:48:48] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:48:48] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:48:48] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:48:48] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:48:49] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:48:49] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-05-28 17:48:49] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 3 ms to minimize.
[2024-05-28 17:48:49] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:48:50] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:48:50] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:48:51] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:48:51] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-28 17:48:51] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:48:51] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-28 17:48:51] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:48:52] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:48:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-28 17:48:53] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:48:53] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:48:53] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:48:53] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:48:54] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:48:54] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:48:54] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:48:55] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:48:55] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:48:55] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:48:56] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:48:57] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:48:57] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:48:57] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:48:58] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:48:58] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 3 ms to minimize.
[2024-05-28 17:48:58] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:48:58] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:48:59] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:49:00] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:49:00] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:49:00] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:49:00] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:49:00] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:49:01] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:49:01] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:49:01] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:49:01] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:49:01] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 3 ms to minimize.
[2024-05-28 17:49:02] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:49:02] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-28 17:49:03] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:49:03] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 3 ms to minimize.
[2024-05-28 17:49:03] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:49:03] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:49:03] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:49:04] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
[2024-05-28 17:49:04] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:05] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:49:05] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:49:06] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:49:06] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:49:07] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:49:08] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:10] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:49:10] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:49:10] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:49:10] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:13] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:49:13] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:49:14] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:49:14] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:49:14] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 3 ms to minimize.
[2024-05-28 17:49:14] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:49:15] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:49:15] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:49:15] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:49:15] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:49:17] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:49:18] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:49:19] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:49:20] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:49:20] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:49:20] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:21] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:49:21] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:21] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:21] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:49:22] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:23] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:49:23] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:49:23] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:49:23] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:49:23] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:49:23] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:24] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:49:24] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:49:24] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:49:24] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:49:25] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:49:25] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:49:27] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:49:28] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:49:28] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:49:28] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:49:29] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-05-28 17:49:29] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:49:29] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:49:29] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:49:30] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-05-28 17:49:30] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-28 17:49:30] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 3 ms to minimize.
[2024-05-28 17:49:30] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:49:32] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:32] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:49:32] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:32] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:49:32] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:49:33] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:49:33] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:49:33] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:36] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:49:36] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:49:36] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:49:36] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:49:36] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:49:37] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:49:38] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:49:39] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:49:39] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:49:39] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:41] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:49:41] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:42] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-28 17:49:42] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:49:43] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:49:43] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:49:43] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:49:44] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
[2024-05-28 17:49:45] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 5 ms to minimize.
[2024-05-28 17:49:45] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 4 ms to minimize.
[2024-05-28 17:49:45] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:49:45] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:49:45] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:49:46] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:49:47] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:49:47] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:49:47] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:49:48] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:49:48] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:49:48] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:49:48] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:49:48] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:49:48] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/613 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:49] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2024-05-28 17:49:49] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:49:50] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:49:51] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:49:52] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/613 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:49:53] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:49:54] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:49:54] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:49:54] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:49:54] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:49:55] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:49:55] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:49:55] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:49:55] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:49:55] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:49:56] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:49:57] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:49:57] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:49:59] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/613 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:00] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:50:01] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:50:01] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:50:01] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:50:01] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:50:01] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:50:02] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:50:02] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:50:02] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:50:02] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:50:03] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:50:04] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:50:04] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:50:04] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/613 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:06] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2024-05-28 17:50:06] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:50:06] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:50:07] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:50:08] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-28 17:50:10] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2024-05-28 17:50:10] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:50:10] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:50:10] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:50:10] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:50:11] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 3 ms to minimize.
[2024-05-28 17:50:11] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:50:11] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-28 17:50:12] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/613 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:13] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:50:14] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/613 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:17] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-28 17:50:17] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:50:17] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:50:17] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:18] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:50:19] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:50:19] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:50:19] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:50:19] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:50:19] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:50:19] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/613 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:50:21] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:24] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:50:24] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:50:24] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:50:26] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:50:26] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/613 variables, 20/495 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:31] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:50:31] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-28 17:50:31] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:50:31] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:50:32] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:50:32] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:50:32] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:50:33] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:50:33] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:50:33] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-28 17:50:34] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:50:35] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-05-28 17:50:35] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 4 ms to minimize.
[2024-05-28 17:50:35] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-05-28 17:50:35] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:50:35] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:50:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/613 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:38] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:50:39] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:50:40] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:50:40] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/613 variables, 20/535 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:41] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:50:41] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:50:41] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 3 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:50:42] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 0 ms to minimize.
[2024-05-28 17:50:43] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:50:44] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:50:44] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/613 variables, 20/555 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-05-28 17:50:45] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:50:45] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:50:45] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:50:45] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:50:47] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-28 17:50:47] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:50:48] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:50:49] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:50:49] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:50:49] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:50:50] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:50:50] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:50:50] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:50:50] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:50:50] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:50:50] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:50:51] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 3 ms to minimize.
[2024-05-28 17:50:51] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-28 17:50:51] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:50:51] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/613 variables, 20/575 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1900 variables, and 575 constraints, problems are : Problem set: 0 solved, 522 unsolved in 135015 ms.
Refiners :[Positive P Invariants (semi-flows): 75/200 constraints, State Equation: 0/863 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 500/500 constraints]
After SMT, in 270097ms problems are : Problem set: 0 solved, 522 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 522 out of 863 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 863/863 places, 1037/1037 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 863 transition count 1035
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 861 transition count 1035
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 861 transition count 1032
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 858 transition count 1032
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 855 transition count 1029
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 853 transition count 1030
Applied a total of 20 rules in 28 ms. Remains 853 /863 variables (removed 10) and now considering 1030/1037 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 853/863 places, 1030/1037 transitions.
RANDOM walk for 3592545 steps (977 resets) in 120004 ms. (29 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (9 resets) in 54 ms. (72 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 522/522 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 522/522 properties
Probabilistic random walk after 1000001 steps, saw 717935 distinct states, run finished after 51391 ms. (steps per millisecond=19 ) properties seen :12
// Phase 1: matrix 1030 rows 853 cols
[2024-05-28 17:52:14] [INFO ] Computed 200 invariants in 3 ms
[2024-05-28 17:52:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 93/603 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 613/1216 variables, 603/678 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1216 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (OVERLAPS) 23/1239 variables, 10/688 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 5/693 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 8 (OVERLAPS) 19/1258 variables, 8/701 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1258 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1258 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 11 (OVERLAPS) 21/1279 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1279 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1279 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 14 (OVERLAPS) 21/1300 variables, 8/725 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 (/ 109.0 110.0))
(t3 0.0)
(t4 (/ 1.0 10.0))
(t5 (/ 9.0 110.0))
(t6 (/ 4.0 55.0))
(t7 0.0)
(t8 (/ 1.0 110.0))
(t9 0.0)
(t10 0.0)
(t11 (/ 1.0 22.0))
(t12 (/ 3.0 110.0))
(t13 (/ 1.0 55.0))
(t14 0.0)
(t15 (/ 1.0 110.0))
(t16 0.0)
(t17 (/ 3.0 55.0))
(t18 (/ 103.0 110.0))
(t19 0.0)
(t20 (/ 4.0 11.0))
(t21 0.0)
(t22 (/ 1.0 22.0))
(t23 (/ 3.0 110.0))
(t24 (/ 1.0 55.0))
(t25 0.0)
(t26 (/ 1.0 110.0))
(t27 0.0)
(t28 (/ 3.0 55.0))
(t29 (/ 1.0 22.0))
(t30 (/ 3.0 110.0))
(t31 (/ 1.0 55.0))
(t32 0.0)
(t33 (/ 1.0 110.0))
(t34 0.0)
(t35 0.0)
(t36 (/ 4.0 11.0))
(t37 (/ 4.0 11.0))
(t38 (/ 4.0 11.0))
(t39 (/ 7.0 110.0))
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 (/ 4.0 11.0))
(t45 (/ 4.0 11.0))
(t46 (/ 4.0 11.0))
(t47 (/ 4.0 11.0))
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 (/ 1.0 22.0))
(t53 (/ 3.0 110.0))
(t54 (/ 1.0 55.0))
(t55 0.0)
(t56 (/ 1.0 110.0))
(t57 0.0)
(t58 (/ 6.0 55.0))
(t59 (/ 1.0 10.0))
(t60 (/ 9.0 110.0))
(t61 (/ 4.0 55.0))
(t62 0.0)
(t63 (/ 1.0 110.0))
(t64 0.0)
(t65 0.0)
(t66 (/ 23.0 110.0))
(t67 (/ 5.0 22.0))
(t68 (/ 23.0 110.0))
(t69 (/ 1.0 5.0))
(t70 0.0)
(t71 (/ 1.0 110.0))
(t72 0.0)
(t73 (/ 3.0 110.0))
(t74 (/ 19.0 55.0))
(t75 (/ 37.0 110.0))
(t76 (/ 7.0 22.0))
(t77 (/ 17.0 55.0))
(t78 0.0)
(t79 (/ 1.0 110.0))
(t80 0.0)
(t81 0.0)
(t82 (/ 2.0 11.0))
(t83 (/ 9.0 55.0))
(t84 (/ 17.0 110.0))
(t85 0.0)
(t86 (/ 1.0 110.0))
(t87 0.0)
(t88 (/ 3.0 110.0))
(t89 (/ 17.0 110.0))
(t90 (/ 3.0 22.0))
(t91 (/ 7.0 55.0))
(t92 0.0)
(t93 (/ 1.0 110.0))
(t94 0.0)
(t95 (/ 3.0 22.0))
(t96 (/ 16.0 55.0))
(t97 (/ 1.0 11.0))
(t98 (/ 4.0 55.0))
(t99 (/ 7.0 110.0))
(t100 0.0)
(t101 (/ 1.0 110.0))
(t102 0.0)
(t103 0.0)
(t104 (/ 16.0 55.0))
(t105 (/ 31.0 110.0))
(t106 (/ 29.0 110.0))
(t107 (/ 14.0 55.0))
(t108 (/ 13.0 55.0))
(t109 (/ 1.0 110.0))
(t110 0.0)
(t111 0.0)
(t112 (/ 1.0 22.0))
(t113 (/ 3.0 110.0))
(t114 (/ 1.0 55.0))
(t115 0.0)
(t116 (/ 1.0 110.0))
(t117 0.0)
(t118 (/ 9.0 110.0))
(t119 (/ 4.0 55.0))
(t120 (/ 3.0 55.0))
(t121 (/ 1.0 22.0))
(t122 (/ 3.0 110.0))
(t123 (/ 1.0 110.0))
(t124 0.0)
(t125 0.0)
(t126 (/ 13.0 55.0))
(t127 (/ 5.0 22.0))
(t128 (/ 23.0 110.0))
(t129 (/ 1.0 5.0))
(t130 0.0)
(t131 (/ 1.0 110.0))
(t132 0.0)
(t133 0.0)
(t134 (/ 13.0 55.0))
(t135 (/ 4.0 11.0))
(t136 (/ 19.0 55.0))
(t137 (/ 37.0 110.0))
(t138 0.0)
(t139 (/ 1.0 110.0))
(t140 0.0)
(t141 (/ 3.0 22.0))
(t142 (/ 2.0 11.0))
(t143 (/ 9.0 55.0))
(t144 (/ 17.0 110.0))
(t145 (/ 3.0 22.0))
(t146 (/ 1.0 110.0))
(t147 0.0)
(t148 0.0)
(t149 (/ 7.0 55.0))
(t150 (/ 6.0 55.0))
(t151 (/ 1.0 10.0))
(t152 0.0)
(t153 (/ 1.0 110.0))
(t154 0.0)
(t155 (/ 3.0 22.0))
(t156 (/ 7.0 22.0))
(t157 (/ 1.0 11.0))
(t158 (/ 4.0 55.0))
(t159 (/ 7.0 110.0))
(t160 0.0)
(t161 (/ 1.0 110.0))
(t162 0.0)
(t163 0.0)
(t164 (/ 7.0 22.0))
(t165 (/ 17.0 55.0))
(t166 (/ 16.0 55.0))
(t167 (/ 31.0 110.0))
(t168 (/ 29.0 110.0))
(t169 (/ 1.0 110.0))
(t170 0.0)
(t171 0.0)
(t172 (/ 1.0 22.0))
(t173 (/ 3.0 110.0))
(t174 (/ 1.0 55.0))
(t175 0.0)
(t176 (/ 1.0 110.0))
(t177 0.0)
(t178 (/ 3.0 55.0))
(t179 (/ 1.0 22.0))
(t180 (/ 3.0 110.0))
(t181 (/ 1.0 55.0))
(t182 0.0)
(t183 (/ 1.0 110.0))
(t184 0.0)
(t185 0.0)
(t186 (/ 1.0 10.0))
(t187 (/ 1.0 11.0))
(t188 (/ 4.0 55.0))
(t189 (/ 7.0 110.0))
(t190 0.0)
(t191 (/ 1.0 110.0))
(t192 0.0)
(t193 0.0)
(t194 (/ 29.0 110.0))
(t195 (/ 14.0 55.0))
(t196 (/ 13.0 55.0))
(t197 (/ 5.0 22.0))
(t198 0.0)
(t199 (/ 1.0 110.0))
(t200 0.0)
(t201 0.0)
(t202 (/ 1.0 22.0))
(t203 (/ 3.0 110.0))
(t204 (/ 1.0 55.0))
(t205 0.0)
(t206 (/ 1.0 110.0))
(t207 0.0)
(t208 (/ 4.0 55.0))
(t209 (/ 4.0 55.0))
(t210 (/ 4.0 55.0))
(t211 (/ 4.0 55.0))
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 (/ 23.0 110.0))
(t217 (/ 1.0 11.0))
(t218 (/ 4.0 55.0))
(t219 (/ 7.0 110.0))
(t220 (/ 1.0 22.0))
(t221 (/ 1.0 110.0))
(t222 0.0)
(t223 0.0)
(t224 (/ 23.0 110.0))
(t225 (/ 1.0 5.0))
(t226 (/ 2.0 11.0))
(t227 (/ 19.0 110.0))
(t228 (/ 17.0 110.0))
(t229 (/ 1.0 110.0))
(t230 0.0)
(t231 0.0)
(t232 (/ 1.0 22.0))
(t233 (/ 3.0 110.0))
(t234 (/ 1.0 55.0))
(t235 0.0)
(t236 (/ 1.0 110.0))
(t237 0.0)
(t238 (/ 4.0 55.0))
(t239 (/ 4.0 55.0))
(t240 (/ 4.0 55.0))
(t241 (/ 4.0 55.0))
(t242 (/ 7.0 110.0))
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 (/ 17.0 110.0))
(t247 (/ 8.0 55.0))
(t248 (/ 7.0 55.0))
(t249 (/ 13.0 110.0))
(t250 0.0)
(t251 (/ 1.0 110.0))
(t252 0.0)
(t253 0.0)
(t254 (/ 17.0 110.0))
(t255 (/ 1.0 5.0))
(t256 (/ 2.0 11.0))
(t257 (/ 19.0 110.0))
(t258 (/ 17.0 110.0))
(t259 (/ 1.0 110.0))
(t260 0.0)
(t261 (/ 3.0 55.0))
(t262 (/ 1.0 10.0))
(t263 (/ 9.0 110.0))
(t264 (/ 4.0 55.0))
(t265 0.0)
(t266 (/ 1.0 110.0))
(t267 0.0)
(t268 (/ 1.0 110.0))
(t269 (/ 4.0 55.0))
(t270 (/ 4.0 55.0))
(t271 (/ 4.0 55.0))
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 (/ 7.0 110.0))
(t276 (/ 17.0 110.0))
(t277 (/ 8.0 55.0))
(t278 (/ 7.0 55.0))
(t279 (/ 13.0 110.0))
(t280 0.0)
(t281 (/ 1.0 110.0))
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 (/ 1.0 22.0))
(t286 (/ 3.0 110.0))
(t287 (/ 1.0 55.0))
(t288 0.0)
(t289 (/ 1.0 110.0))
(t290 0.0)
(t291 (/ 3.0 55.0))
(t292 (/ 1.0 10.0))
(t293 (/ 9.0 110.0))
(t294 (/ 4.0 55.0))
(t295 (/ 3.0 55.0))
(t296 (/ 1.0 110.0))
(t297 0.0)
(t298 0.0)
(t299 (/ 1.0 22.0))
(t300 (/ 3.0 110.0))
(t301 (/ 1.0 55.0))
(t302 0.0)
(t303 (/ 1.0 110.0))
(t304 0.0)
(t305 (/ 3.0 55.0))
(t306 0.0)
(t307 (/ 1.0 5.0))
(t308 (/ 2.0 11.0))
(t309 (/ 19.0 110.0))
(t310 0.0)
(t311 (/ 1.0 110.0))
(t312 0.0)
(t313 (/ 23.0 110.0))
(t314 0.0)
(t315 (/ 1.0 10.0))
(t316 (/ 9.0 110.0))
(t317 (/ 4.0 55.0))
(t318 0.0)
(t319 (/ 1.0 110.0))
(t320 0.0)
(t321 (/ 6.0 55.0))
(t322 (/ 17.0 110.0))
(t323 (/ 3.0 22.0))
(t324 (/ 7.0 55.0))
(t325 0.0)
(t326 (/ 1.0 110.0))
(t327 0.0)
(t328 (/ 23.0 110.0))
(t329 (/ 1.0 5.0))
(t330 (/ 3.0 110.0))
(t331 (/ 1.0 55.0))
(t332 0.0)
(t333 (/ 9.0 55.0))
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 (/ 14.0 55.0))
(t338 (/ 13.0 55.0))
(t339 (/ 5.0 22.0))
(t340 0.0)
(t341 (/ 1.0 110.0))
(t342 0.0)
(t343 (/ 29.0 110.0))
(t344 (/ 3.0 55.0))
(t345 (/ 1.0 22.0))
(t346 (/ 3.0 110.0))
(t347 (/ 1.0 55.0))
(t348 0.0)
(t349 (/ 1.0 110.0))
(t350 0.0)
(t351 0.0)
(t352 (/ 23.0 110.0))
(t353 (/ 21.0 110.0))
(t354 (/ 1.0 55.0))
(t355 0.0)
(t356 (/ 1.0 110.0))
(t357 0.0)
(t358 (/ 29.0 110.0))
(t359 (/ 14.0 55.0))
(t360 (/ 13.0 55.0))
(t361 (/ 5.0 22.0))
(t362 0.0)
(t363 (/ 1.0 110.0))
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 (/ 1.0 5.0))
(t368 (/ 2.0 11.0))
(t369 (/ 19.0 110.0))
(t370 (/ 17.0 110.0))
(t371 (/ 1.0 110.0))
(t372 0.0)
(t373 (/ 23.0 110.0))
(t374 0.0)
(t375 (/ 1.0 10.0))
(t376 (/ 9.0 110.0))
(t377 (/ 4.0 55.0))
(t378 0.0)
(t379 (/ 1.0 110.0))
(t380 0.0)
(t381 (/ 6.0 55.0))
(t382 (/ 17.0 110.0))
(t383 (/ 3.0 22.0))
(t384 (/ 7.0 55.0))
(t385 (/ 6.0 55.0))
(t386 (/ 1.0 110.0))
(t387 0.0)
(t388 (/ 23.0 110.0))
(t389 (/ 17.0 55.0))
(t390 (/ 16.0 55.0))
(t391 (/ 31.0 110.0))
(t392 0.0)
(t393 (/ 1.0 110.0))
(t394 0.0)
(t395 (/ 6.0 55.0))
(t396 (/ 3.0 55.0))
(t397 (/ 23.0 110.0))
(t398 (/ 21.0 110.0))
(t399 (/ 2.0 11.0))
(t400 (/ 9.0 55.0))
(t401 (/ 1.0 110.0))
(t402 0.0)
(t403 (/ 9.0 55.0))
(t404 (/ 3.0 55.0))
(t405 (/ 19.0 110.0))
(t406 (/ 19.0 110.0))
(t407 (/ 19.0 110.0))
(t408 0.0)
(t409 0.0)
(t410 0.0)
(t411 (/ 7.0 55.0))
(t412 (/ 9.0 55.0))
(t413 (/ 8.0 55.0))
(t414 (/ 3.0 22.0))
(t415 (/ 13.0 110.0))
(t416 (/ 1.0 110.0))
(t417 0.0)
(t418 (/ 9.0 55.0))
(t419 (/ 14.0 55.0))
(t420 (/ 13.0 55.0))
(t421 (/ 5.0 22.0))
(t422 (/ 23.0 110.0))
(t423 (/ 1.0 110.0))
(t424 0.0)
(t425 (/ 1.0 10.0))
(t426 (/ 17.0 110.0))
(t427 (/ 5.0 22.0))
(t428 (/ 23.0 110.0))
(t429 (/ 1.0 5.0))
(t430 0.0)
(t431 (/ 1.0 110.0))
(t432 0.0)
(t433 (/ 9.0 110.0))
(t434 (/ 17.0 110.0))
(t435 (/ 31.0 110.0))
(t436 (/ 29.0 110.0))
(t437 (/ 14.0 55.0))
(t438 0.0)
(t439 (/ 1.0 110.0))
(t440 0.0)
(t441 (/ 3.0 22.0))
(t442 (/ 2.0 11.0))
(t443 (/ 9.0 55.0))
(t444 (/ 17.0 110.0))
(t445 (/ 3.0 22.0))
(t446 (/ 1.0 110.0))
(t447 0.0)
(t448 (/ 9.0 110.0))
(t449 (/ 23.0 110.0))
(t450 (/ 21.0 110.0))
(t451 (/ 2.0 11.0))
(t452 0.0)
(t453 (/ 1.0 110.0))
(t454 0.0)
(t455 (/ 3.0 22.0))
(t456 (/ 13.0 55.0))
(t457 (/ 5.0 22.0))
(t458 (/ 23.0 110.0))
(t459 (/ 1.0 5.0))
(t460 0.0)
(t461 (/ 1.0 110.0))
(t462 0.0)
(t463 0.0)
(t464 0.0)
(t465 (/ 7.0 55.0))
(t466 (/ 6.0 55.0))
(t467 (/ 1.0 10.0))
(t468 0.0)
(t469 (/ 1.0 110.0))
(t470 0.0)
(t471 (/ 3.0 22.0))
(t472 (/ 2.0 11.0))
(t473 (/ 9.0 55.0))
(t474 (/ 17.0 110.0))
(t475 0.0)
(t476 (/ 1.0 110.0))
(t477 0.0)
(t478 0.0)
(t479 (/ 7.0 55.0))
(t480 (/ 6.0 55.0))
(t481 (/ 1.0 10.0))
(t482 (/ 9.0 110.0))
(t483 (/ 1.0 110.0))
(t484 0.0)
(t485 (/ 3.0 22.0))
(t486 (/ 9.0 110.0))
(t487 (/ 1.0 11.0))
(t488 (/ 4.0 55.0))
(t489 (/ 7.0 110.0))
(t490 0.0)
(t491 (/ 1.0 110.0))
(t492 0.0)
(t493 (/ 1.0 55.0))
(t494 (/ 9.0 110.0))
(t495 (/ 4.0 55.0))
(t496 (/ 3.0 55.0))
(t497 (/ 1.0 22.0))
(t498 0.0)
(t499 (/ 1.0 110.0))
(t500 0.0)
(t501 0.0)
(t502 (/ 1.0 22.0))
(t503 (/ 3.0 110.0))
(t504 (/ 1.0 55.0))
(t505 0.0)
(t506 (/ 1.0 110.0))
(t507 0.0)
(t508 (/ 1.0 55.0))
(t509 (/ 3.0 110.0))
(t510 (/ 3.0 110.0))
(t511 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 150082ms, After SMT, problems are : Problem set: 0 solved, 510 unsolved
Fused 510 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 510 out of 853 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 853/853 places, 1030/1030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 853 transition count 1028
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 851 transition count 1028
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 851 transition count 1025
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 848 transition count 1025
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 845 transition count 1022
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 843 transition count 1023
Applied a total of 20 rules in 26 ms. Remains 843 /853 variables (removed 10) and now considering 1023/1030 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 843/853 places, 1023/1030 transitions.
RANDOM walk for 1627904 steps (426 resets) in 120004 ms. (13 steps per ms) remains 500/510 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (9 resets) in 57 ms. (69 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 500/500 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 500/500 properties
Probabilistic random walk after 1000001 steps, saw 716929 distinct states, run finished after 50785 ms. (steps per millisecond=19 ) properties seen :12
// Phase 1: matrix 1023 rows 843 cols
[2024-05-28 17:56:05] [INFO ] Computed 200 invariants in 4 ms
[2024-05-28 17:56:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 105/593 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (OVERLAPS) 606/1199 variables, 593/668 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1199 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (OVERLAPS) 23/1222 variables, 10/678 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1222 variables, 5/683 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1222 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 8 (OVERLAPS) 19/1241 variables, 8/691 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 4/695 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 11 (OVERLAPS) 21/1262 variables, 8/703 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1262 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1262 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 14 (OVERLAPS) 21/1283 variables, 8/715 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1283 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1283 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 17 (OVERLAPS) 22/1305 variables, 8/727 constraints. Problems are: Problem set: 0 solved, 488 unsolved
SMT process timed out in 165083ms, After SMT, problems are : Problem set: 0 solved, 488 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 488 out of 843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 843/843 places, 1023/1023 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 843 transition count 1019
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 839 transition count 1019
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 8 place count 839 transition count 1012
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 832 transition count 1012
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 827 transition count 1007
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 825 transition count 1008
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 825 transition count 1008
Applied a total of 38 rules in 35 ms. Remains 825 /843 variables (removed 18) and now considering 1008/1023 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 825/843 places, 1008/1023 transitions.
RANDOM walk for 1532265 steps (397 resets) in 120004 ms. (12 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 447 ms. (89 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (9 resets) in 490 ms. (81 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (9 resets) in 491 ms. (81 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (9 resets) in 521 ms. (76 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (9 resets) in 486 ms. (82 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 497 ms. (80 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (9 resets) in 510 ms. (78 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (9 resets) in 431 ms. (92 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 473 ms. (84 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 406 ms. (98 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 485 ms. (82 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (9 resets) in 438 ms. (91 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 479 ms. (83 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 474 ms. (84 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (9 resets) in 525 ms. (76 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (9 resets) in 381 ms. (104 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 407 ms. (98 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (9 resets) in 493 ms. (80 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (10 resets) in 440 ms. (90 steps per ms) remains 488/488 properties
BEST_FIRST walk for 40003 steps (8 resets) in 506 ms. (78 steps per ms) remains 488/488 properties
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 StableMarking -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="ShieldRVt-PT-050B"
export BK_EXAMINATION="StableMarking"
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 ShieldRVt-PT-050B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r364-tall-171683778300648"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;