About the Execution of 2024-gold for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15688.850 | 1800000.00 | 2794877.00 | 4588.70 | [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/mcc2025-input.r098-smll-174860112300217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FireWire-PT-14, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K May 29 14:32 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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748681949563
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 08:59:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 08:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:59:12] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2025-05-31 08:59:12] [INFO ] Transformed 205 places.
[2025-05-31 08:59:12] [INFO ] Transformed 610 transitions.
[2025-05-31 08:59:12] [INFO ] Found NUPN structural information;
[2025-05-31 08:59:12] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 596 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 205/205 places, 610/610 transitions.
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 71 place count 205 transition count 536
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 202 transition count 536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 199 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 196 transition count 539
Applied a total of 89 rules in 146 ms. Remains 196 /205 variables (removed 9) and now considering 539/610 (removed 71) transitions.
[2025-05-31 08:59:13] [INFO ] Flow matrix only has 491 transitions (discarded 48 similar events)
// Phase 1: matrix 491 rows 196 cols
[2025-05-31 08:59:13] [INFO ] Computed 10 invariants in 59 ms
[2025-05-31 08:59:13] [INFO ] Implicit Places using invariants in 862 ms returned []
[2025-05-31 08:59:13] [INFO ] Flow matrix only has 491 transitions (discarded 48 similar events)
[2025-05-31 08:59:13] [INFO ] Invariant cache hit.
[2025-05-31 08:59:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 08:59:15] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned [19, 80, 141]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 2405 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 193/205 places, 539/610 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 539/539 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2602 ms. Remains : 193/205 places, 539/610 transitions.
Discarding 156 transitions out of 539. Remains 383
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1280 resets) in 4545 ms. (8 steps per ms) remains 171/382 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 171/171 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 171/171 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 171/171 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 171/171 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 171/171 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 171/171 properties
[2025-05-31 08:59:17] [INFO ] Flow matrix only has 491 transitions (discarded 48 similar events)
// Phase 1: matrix 491 rows 193 cols
[2025-05-31 08:59:17] [INFO ] Computed 7 invariants in 8 ms
[2025-05-31 08:59:17] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 74/193 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 74/200 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2025-05-31 08:59:21] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 26 ms to minimize.
[2025-05-31 08:59:21] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 3 ms to minimize.
[2025-05-31 08:59:21] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2025-05-31 08:59:21] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 3 ms to minimize.
[2025-05-31 08:59:22] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 3 ms to minimize.
SMT process timed out in 5917ms, After SMT, problems are : Problem set: 0 solved, 171 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 193 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 193 transition count 521
Applied a total of 18 rules in 87 ms. Remains 193 /193 variables (removed 0) and now considering 521/539 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 193/193 places, 521/539 transitions.
RANDOM walk for 4000000 steps (124489 resets) in 45034 ms. (88 steps per ms) remains 83/171 properties
BEST_FIRST walk for 400003 steps (2793 resets) in 857 ms. (466 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (148 resets) in 1942 ms. (205 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (2652 resets) in 878 ms. (455 steps per ms) remains 81/83 properties
BEST_FIRST walk for 400004 steps (3827 resets) in 1046 ms. (382 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2747 resets) in 1323 ms. (302 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (36 resets) in 1949 ms. (205 steps per ms) remains 80/81 properties
BEST_FIRST walk for 400003 steps (2593 resets) in 865 ms. (461 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3820 resets) in 846 ms. (472 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2758 resets) in 816 ms. (489 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (332 resets) in 1284 ms. (311 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2728 resets) in 842 ms. (474 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3874 resets) in 1125 ms. (355 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2772 resets) in 1110 ms. (360 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (249 resets) in 1503 ms. (265 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2619 resets) in 1128 ms. (354 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (3759 resets) in 1101 ms. (362 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2743 resets) in 1023 ms. (390 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (146 resets) in 2317 ms. (172 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2663 resets) in 879 ms. (454 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3824 resets) in 869 ms. (459 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2741 resets) in 1016 ms. (393 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (174 resets) in 2122 ms. (188 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2627 resets) in 844 ms. (473 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2745 resets) in 809 ms. (493 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2685 resets) in 1139 ms. (350 steps per ms) remains 79/80 properties
BEST_FIRST walk for 400004 steps (2799 resets) in 984 ms. (406 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 864 ms. (462 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2715 resets) in 885 ms. (451 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2697 resets) in 1133 ms. (352 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2807 resets) in 820 ms. (487 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2710 resets) in 948 ms. (421 steps per ms) remains 78/79 properties
BEST_FIRST walk for 400003 steps (2700 resets) in 1128 ms. (354 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (158 resets) in 1542 ms. (259 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (2674 resets) in 1127 ms. (354 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (3819 resets) in 1099 ms. (363 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (2736 resets) in 854 ms. (467 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (177 resets) in 1589 ms. (251 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (2689 resets) in 1222 ms. (327 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (3839 resets) in 1126 ms. (354 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (2794 resets) in 1056 ms. (378 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (188 resets) in 1962 ms. (203 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (2682 resets) in 1098 ms. (363 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (3754 resets) in 1026 ms. (389 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (2780 resets) in 1113 ms. (359 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (257 resets) in 1727 ms. (231 steps per ms) remains 77/78 properties
BEST_FIRST walk for 400003 steps (2625 resets) in 859 ms. (465 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3842 resets) in 1012 ms. (394 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 1013 ms. (394 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400001 steps (35 resets) in 1832 ms. (218 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2597 resets) in 1023 ms. (390 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3836 resets) in 1125 ms. (355 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2826 resets) in 1099 ms. (363 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (226 resets) in 1317 ms. (303 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400004 steps (2809 resets) in 1053 ms. (379 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2739 resets) in 1076 ms. (371 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2768 resets) in 1107 ms. (361 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2622 resets) in 1065 ms. (375 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2865 resets) in 853 ms. (468 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2700 resets) in 850 ms. (470 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2828 resets) in 842 ms. (474 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2733 resets) in 848 ms. (471 steps per ms) remains 75/76 properties
BEST_FIRST walk for 400002 steps (2747 resets) in 853 ms. (468 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1661 ms. (240 steps per ms) remains 74/75 properties
BEST_FIRST walk for 400004 steps (2662 resets) in 840 ms. (475 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3848 resets) in 837 ms. (477 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2777 resets) in 826 ms. (483 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (65 resets) in 1311 ms. (304 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2691 resets) in 793 ms. (503 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3798 resets) in 1098 ms. (363 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2717 resets) in 786 ms. (508 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (115 resets) in 1366 ms. (292 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2693 resets) in 829 ms. (481 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3829 resets) in 1119 ms. (357 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2881 resets) in 812 ms. (492 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (134 resets) in 1356 ms. (294 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2719 resets) in 839 ms. (476 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2720 resets) in 815 ms. (490 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2734 resets) in 856 ms. (466 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2736 resets) in 985 ms. (405 steps per ms) remains 74/74 properties
[2025-05-31 09:00:05] [INFO ] Flow matrix only has 487 transitions (discarded 34 similar events)
// Phase 1: matrix 487 rows 193 cols
[2025-05-31 09:00:05] [INFO ] Computed 7 invariants in 6 ms
[2025-05-31 09:00:05] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 128/181 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-31 09:00:06] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2025-05-31 09:00:06] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2025-05-31 09:00:07] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 6/187 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-31 09:00:08] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2025-05-31 09:00:08] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 484/671 variables, 187/386 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 74/460 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 9/680 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/680 variables, 6/472 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/680 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (OVERLAPS) 0/680 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 680/680 variables, and 472 constraints, problems are : Problem set: 0 solved, 74 unsolved in 10120 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 128/181 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 6/187 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 484/671 variables, 187/386 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 74/460 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 73/533 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-31 09:00:19] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2025-05-31 09:00:20] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-31 09:00:26] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2025-05-31 09:00:26] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/671 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (OVERLAPS) 9/680 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/680 variables, 6/549 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/680 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-31 09:00:48] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/680 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-31 09:00:55] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/680 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 552 constraints, problems are : Problem set: 0 solved, 74 unsolved in 45020 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 11/11 constraints]
After SMT, in 55308ms problems are : Problem set: 0 solved, 74 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 521/521 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 190 transition count 515
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 190 transition count 515
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 190 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 189 transition count 511
Applied a total of 10 rules in 59 ms. Remains 189 /193 variables (removed 4) and now considering 511/521 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 189/193 places, 511/521 transitions.
RANDOM walk for 4000000 steps (128232 resets) in 34516 ms. (115 steps per ms) remains 73/74 properties
BEST_FIRST walk for 400003 steps (2816 resets) in 815 ms. (490 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (210 resets) in 1519 ms. (263 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2670 resets) in 790 ms. (505 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (3887 resets) in 788 ms. (506 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2809 resets) in 777 ms. (514 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (220 resets) in 1366 ms. (292 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2628 resets) in 798 ms. (500 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (3875 resets) in 781 ms. (511 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2775 resets) in 777 ms. (514 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (101 resets) in 1565 ms. (255 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (2698 resets) in 795 ms. (502 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (3889 resets) in 784 ms. (509 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2755 resets) in 792 ms. (504 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (216 resets) in 1344 ms. (297 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2701 resets) in 801 ms. (498 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (3900 resets) in 779 ms. (512 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2773 resets) in 791 ms. (505 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (307 resets) in 1359 ms. (294 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2658 resets) in 824 ms. (484 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 817 ms. (489 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2767 resets) in 812 ms. (492 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (151 resets) in 1662 ms. (240 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2716 resets) in 830 ms. (481 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (2775 resets) in 817 ms. (489 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2754 resets) in 826 ms. (483 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2751 resets) in 822 ms. (486 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2776 resets) in 821 ms. (486 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (304 resets) in 1358 ms. (294 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2711 resets) in 837 ms. (477 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (3840 resets) in 826 ms. (483 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (2795 resets) in 816 ms. (489 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (271 resets) in 1581 ms. (252 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2696 resets) in 828 ms. (482 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (3857 resets) in 822 ms. (486 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2804 resets) in 825 ms. (484 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1002 ms. (398 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2653 resets) in 821 ms. (486 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (3861 resets) in 809 ms. (493 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2852 resets) in 810 ms. (493 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400001 steps (199 resets) in 1519 ms. (263 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2690 resets) in 1088 ms. (367 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (3882 resets) in 809 ms. (493 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2793 resets) in 813 ms. (491 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (240 resets) in 1019 ms. (392 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2660 resets) in 816 ms. (489 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (3897 resets) in 810 ms. (493 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2779 resets) in 809 ms. (493 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (246 resets) in 1441 ms. (277 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2751 resets) in 816 ms. (489 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2707 resets) in 825 ms. (484 steps per ms) remains 73/73 properties
Interrupted probabilistic random walk after 5707916 steps, run timeout after 72001 ms. (steps per millisecond=79 ) properties seen :4 out of 73
Probabilistic random walk after 5707916 steps, saw 1481035 distinct states, run finished after 72010 ms. (steps per millisecond=79 ) properties seen :4
[2025-05-31 09:02:37] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:02:37] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:02:37] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 129/177 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:02:37] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2025-05-31 09:02:37] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 2 ms to minimize.
[2025-05-31 09:02:38] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2025-05-31 09:02:38] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
[2025-05-31 09:02:38] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2025-05-31 09:02:38] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 472/649 variables, 177/188 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 71/259 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 15/664 variables, 10/269 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:02:42] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 2/666 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/666 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 274 constraints, problems are : Problem set: 0 solved, 69 unsolved in 11003 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 129/177 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 472/649 variables, 177/188 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 71/259 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 15/664 variables, 10/337 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:02:58] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2025-05-31 09:02:58] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-05-31 09:02:58] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 2/666 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:03:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/666 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 18 (OVERLAPS) 0/666 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 347 constraints, problems are : Problem set: 0 solved, 69 unsolved in 34308 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 11/11 constraints]
After SMT, in 45481ms problems are : Problem set: 0 solved, 69 unsolved
Fused 69 Parikh solutions to 68 different solutions.
Parikh walk visited 0 properties in 6328 ms.
Support contains 48 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 20 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 4000000 steps (128276 resets) in 32258 ms. (123 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2785 resets) in 769 ms. (519 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400001 steps (176 resets) in 1185 ms. (337 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2690 resets) in 808 ms. (494 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (3921 resets) in 805 ms. (496 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2798 resets) in 774 ms. (516 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400001 steps (161 resets) in 1617 ms. (247 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2618 resets) in 824 ms. (484 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (3836 resets) in 812 ms. (492 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2805 resets) in 802 ms. (498 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (229 resets) in 1505 ms. (265 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2707 resets) in 820 ms. (487 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (3852 resets) in 804 ms. (496 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2842 resets) in 808 ms. (494 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (323 resets) in 1008 ms. (396 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2723 resets) in 812 ms. (492 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (3861 resets) in 802 ms. (498 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2808 resets) in 771 ms. (518 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (113 resets) in 938 ms. (425 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2660 resets) in 1231 ms. (324 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (3877 resets) in 777 ms. (514 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2806 resets) in 781 ms. (511 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (123 resets) in 1643 ms. (243 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 817 ms. (489 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2713 resets) in 815 ms. (490 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2769 resets) in 808 ms. (494 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (246 resets) in 1342 ms. (297 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2681 resets) in 813 ms. (491 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (3853 resets) in 808 ms. (494 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2804 resets) in 809 ms. (493 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (130 resets) in 1406 ms. (284 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2634 resets) in 822 ms. (486 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (3894 resets) in 804 ms. (496 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2751 resets) in 798 ms. (500 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (327 resets) in 1235 ms. (323 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2681 resets) in 822 ms. (486 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (3835 resets) in 807 ms. (495 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2828 resets) in 794 ms. (503 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (240 resets) in 1546 ms. (258 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2637 resets) in 825 ms. (484 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 803 ms. (497 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2779 resets) in 801 ms. (498 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1479 ms. (270 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2702 resets) in 818 ms. (488 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (3923 resets) in 809 ms. (493 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2804 resets) in 807 ms. (495 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (295 resets) in 980 ms. (407 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2679 resets) in 820 ms. (487 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2782 resets) in 813 ms. (491 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2679 resets) in 812 ms. (492 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2816 resets) in 808 ms. (494 steps per ms) remains 69/69 properties
Interrupted probabilistic random walk after 5720602 steps, run timeout after 69001 ms. (steps per millisecond=82 ) properties seen :0 out of 69
Probabilistic random walk after 5720602 steps, saw 1484045 distinct states, run finished after 69005 ms. (steps per millisecond=82 ) properties seen :0
[2025-05-31 09:05:00] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:05:00] [INFO ] Invariant cache hit.
[2025-05-31 09:05:00] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 129/177 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:05:01] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 2 ms to minimize.
[2025-05-31 09:05:01] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
[2025-05-31 09:05:01] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2025-05-31 09:05:02] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:05:03] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 472/649 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 71/258 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 15/664 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:05:10] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 2/666 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 273 constraints, problems are : Problem set: 0 solved, 69 unsolved in 17335 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 129/177 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 472/649 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 71/258 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 15/664 variables, 10/336 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 2/666 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 09:05:37] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2025-05-31 09:05:37] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 5 ms to minimize.
[2025-05-31 09:05:37] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2025-05-31 09:05:37] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2025-05-31 09:05:37] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/666 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 17 (OVERLAPS) 0/666 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 347 constraints, problems are : Problem set: 0 solved, 69 unsolved in 31465 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 11/11 constraints]
After SMT, in 48911ms problems are : Problem set: 0 solved, 69 unsolved
Parikh walk visited 0 properties in 21881 ms.
Support contains 48 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 18 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 189/189 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 16 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2025-05-31 09:06:11] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:06:11] [INFO ] Invariant cache hit.
[2025-05-31 09:06:11] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-31 09:06:11] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:06:11] [INFO ] Invariant cache hit.
[2025-05-31 09:06:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:06:12] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2025-05-31 09:06:12] [INFO ] Redundant transitions in 46 ms returned []
Running 505 sub problems to find dead transitions.
[2025-05-31 09:06:12] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:06:12] [INFO ] Invariant cache hit.
[2025-05-31 09:06:12] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:06:16] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2025-05-31 09:06:16] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
[2025-05-31 09:06:16] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2025-05-31 09:06:16] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 2 ms to minimize.
[2025-05-31 09:06:16] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 3 ms to minimize.
[2025-05-31 09:06:17] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2025-05-31 09:06:18] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:06:23] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 477/666 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/275 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:06:31] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 2 ms to minimize.
[2025-05-31 09:06:31] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2025-05-31 09:06:31] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2025-05-31 09:06:35] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2025-05-31 09:06:35] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 280 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 477/666 variables, 189/209 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 71/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 505/785 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:06:56] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
[2025-05-31 09:06:57] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2025-05-31 09:06:57] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 788 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 16/16 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 61102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61776 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 400000 steps (12934 resets) in 4448 ms. (89 steps per ms) remains 40/48 properties
Running SMT prover for 40 properties.
[2025-05-31 09:07:14] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:07:14] [INFO ] Invariant cache hit.
[2025-05-31 09:07:14] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:07:15] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :40
[2025-05-31 09:07:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:07:15] [INFO ] After 160ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :40
TRAPS : Iteration 0
[2025-05-31 09:07:16] [INFO ] After 1464ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:40
[2025-05-31 09:07:16] [INFO ] After 1825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2025-05-31 09:07:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:07:17] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :40
[2025-05-31 09:07:17] [INFO ] After 374ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :40
TRAPS : Iteration 0
[2025-05-31 09:07:17] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2025-05-31 09:07:17] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2025-05-31 09:07:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:07:17] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:07:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 378 ms
[2025-05-31 09:07:18] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 3 ms to minimize.
[2025-05-31 09:07:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
TRAPS : Iteration 1
[2025-05-31 09:07:21] [INFO ] After 4248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :40
[2025-05-31 09:07:21] [INFO ] After 4895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :40
RANDOM walk for 4000000 steps (128335 resets) in 59484 ms. (67 steps per ms) remains 68/69 properties
BEST_FIRST walk for 400003 steps (2761 resets) in 1388 ms. (287 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (177 resets) in 2428 ms. (164 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2696 resets) in 1715 ms. (233 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3889 resets) in 1625 ms. (246 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2766 resets) in 1508 ms. (265 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (282 resets) in 2507 ms. (159 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2581 resets) in 1796 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (3854 resets) in 1721 ms. (232 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2753 resets) in 2389 ms. (167 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (488 resets) in 1497 ms. (267 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2708 resets) in 1751 ms. (228 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3896 resets) in 1681 ms. (237 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2803 resets) in 1511 ms. (264 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (231 resets) in 2650 ms. (150 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2706 resets) in 1729 ms. (231 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3842 resets) in 1336 ms. (299 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2774 resets) in 1515 ms. (263 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (293 resets) in 1644 ms. (243 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2725 resets) in 1372 ms. (291 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3902 resets) in 1419 ms. (281 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2757 resets) in 1726 ms. (231 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (183 resets) in 3007 ms. (132 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2666 resets) in 1768 ms. (226 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2645 resets) in 1561 ms. (256 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (2759 resets) in 1706 ms. (234 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (238 resets) in 2272 ms. (175 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2729 resets) in 1463 ms. (273 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (3875 resets) in 1490 ms. (268 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (2796 resets) in 1612 ms. (247 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (126 resets) in 2758 ms. (144 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2651 resets) in 1291 ms. (309 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3867 resets) in 1508 ms. (265 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2826 resets) in 1818 ms. (219 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (58 resets) in 2922 ms. (136 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2725 resets) in 1462 ms. (273 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3849 resets) in 1422 ms. (281 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (2841 resets) in 1274 ms. (313 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (122 resets) in 3511 ms. (113 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 1344 ms. (297 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (3857 resets) in 1516 ms. (263 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2761 resets) in 1467 ms. (272 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (224 resets) in 2762 ms. (144 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2642 resets) in 1232 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3861 resets) in 1513 ms. (264 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 1410 ms. (283 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (83 resets) in 2512 ms. (159 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2772 resets) in 1403 ms. (284 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2787 resets) in 1574 ms. (253 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 1648 ms. (242 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2787 resets) in 1390 ms. (287 steps per ms) remains 68/68 properties
Interrupted probabilistic random walk after 12055072 steps, run timeout after 165001 ms. (steps per millisecond=73 ) properties seen :0 out of 68
Probabilistic random walk after 12055072 steps, saw 3206052 distinct states, run finished after 165001 ms. (steps per millisecond=73 ) properties seen :0
[2025-05-31 09:11:02] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:11:02] [INFO ] Invariant cache hit.
[2025-05-31 09:11:02] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 128/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:11:03] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2025-05-31 09:11:03] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2025-05-31 09:11:04] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 471/645 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 71/252 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 18/663 variables, 12/264 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 3/666 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 270 constraints, problems are : Problem set: 0 solved, 68 unsolved in 14388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 128/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 471/645 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 71/252 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 68/320 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:11:21] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 18/663 variables, 12/333 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:11:29] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2025-05-31 09:11:29] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 3/666 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:11:41] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2025-05-31 09:11:41] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2025-05-31 09:11:41] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:11:50] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2025-05-31 09:11:50] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2025-05-31 09:11:50] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/666 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 18 (OVERLAPS) 0/666 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 347 constraints, problems are : Problem set: 0 solved, 68 unsolved in 49947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 12/12 constraints]
After SMT, in 64437ms problems are : Problem set: 0 solved, 68 unsolved
Parikh walk visited 0 properties in 3311 ms.
Support contains 46 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 4000000 steps (128193 resets) in 50455 ms. (79 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2731 resets) in 1368 ms. (292 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (370 resets) in 1814 ms. (220 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2715 resets) in 1262 ms. (316 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3886 resets) in 1383 ms. (289 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2850 resets) in 1393 ms. (286 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (240 resets) in 2464 ms. (162 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2719 resets) in 1432 ms. (279 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3863 resets) in 1693 ms. (236 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (2895 resets) in 1692 ms. (236 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (185 resets) in 2865 ms. (139 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2660 resets) in 1485 ms. (269 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3842 resets) in 1406 ms. (284 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2853 resets) in 1831 ms. (218 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (169 resets) in 2706 ms. (147 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2699 resets) in 1362 ms. (293 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3866 resets) in 1696 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2739 resets) in 1745 ms. (229 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (218 resets) in 2798 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2700 resets) in 1399 ms. (285 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3865 resets) in 1529 ms. (261 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2814 resets) in 1262 ms. (316 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (146 resets) in 2288 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2646 resets) in 1525 ms. (262 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2671 resets) in 1709 ms. (233 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2866 resets) in 1844 ms. (216 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (131 resets) in 2154 ms. (185 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2703 resets) in 1694 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3830 resets) in 1578 ms. (253 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2765 resets) in 1768 ms. (226 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (128 resets) in 2642 ms. (151 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2678 resets) in 1273 ms. (313 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3822 resets) in 1458 ms. (274 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2786 resets) in 1452 ms. (275 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (330 resets) in 1616 ms. (247 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2733 resets) in 1432 ms. (279 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3913 resets) in 1384 ms. (288 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2760 resets) in 1845 ms. (216 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (272 resets) in 2282 ms. (175 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 1233 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (3877 resets) in 1344 ms. (297 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2805 resets) in 1278 ms. (312 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (271 resets) in 2070 ms. (193 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 1764 ms. (226 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (3835 resets) in 1478 ms. (270 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2803 resets) in 1437 ms. (278 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (240 resets) in 3579 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2628 resets) in 1447 ms. (276 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 1434 ms. (278 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2673 resets) in 1474 ms. (271 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2692 resets) in 1557 ms. (256 steps per ms) remains 68/68 properties
Interrupted probabilistic random walk after 10420507 steps, run timeout after 144001 ms. (steps per millisecond=72 ) properties seen :0 out of 68
Probabilistic random walk after 10420507 steps, saw 2769772 distinct states, run finished after 144001 ms. (steps per millisecond=72 ) properties seen :0
[2025-05-31 09:15:22] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:15:22] [INFO ] Invariant cache hit.
[2025-05-31 09:15:22] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 128/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:15:23] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 3 ms to minimize.
[2025-05-31 09:15:23] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
[2025-05-31 09:15:24] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 471/645 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 71/252 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 18/663 variables, 12/264 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 3/666 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 270 constraints, problems are : Problem set: 0 solved, 68 unsolved in 14112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 128/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 471/645 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 71/252 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 68/320 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:15:41] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 18/663 variables, 12/333 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 09:15:50] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 3/666 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 15 (OVERLAPS) 0/666 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 340 constraints, problems are : Problem set: 0 solved, 68 unsolved in 30418 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 5/5 constraints]
After SMT, in 44640ms problems are : Problem set: 0 solved, 68 unsolved
Parikh walk visited 0 properties in 7937 ms.
Support contains 46 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 189/189 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2025-05-31 09:16:15] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:16:15] [INFO ] Invariant cache hit.
[2025-05-31 09:16:15] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-31 09:16:15] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:16:15] [INFO ] Invariant cache hit.
[2025-05-31 09:16:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:16:15] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2025-05-31 09:16:15] [INFO ] Redundant transitions in 9 ms returned []
Running 505 sub problems to find dead transitions.
[2025-05-31 09:16:15] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:16:15] [INFO ] Invariant cache hit.
[2025-05-31 09:16:15] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:16:20] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2025-05-31 09:16:20] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2025-05-31 09:16:20] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:16:21] [INFO ] Deduced a trap composed of 71 places in 267 ms of which 3 ms to minimize.
[2025-05-31 09:16:21] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 3 ms to minimize.
[2025-05-31 09:16:21] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 4 ms to minimize.
[2025-05-31 09:16:23] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:16:30] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 477/666 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/275 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:16:43] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 4 ms to minimize.
[2025-05-31 09:16:43] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 3 ms to minimize.
[2025-05-31 09:16:43] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 278 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 477/666 variables, 189/207 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 71/278 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 505/783 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:16:59] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2025-05-31 09:16:59] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2025-05-31 09:17:00] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 3/786 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 786 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 14/14 constraints]
After SMT, in 60877ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60888ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61565 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 400000 steps (12745 resets) in 4952 ms. (80 steps per ms) remains 39/46 properties
Running SMT prover for 39 properties.
[2025-05-31 09:17:18] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:17:18] [INFO ] Invariant cache hit.
[2025-05-31 09:17:18] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:17:19] [INFO ] After 208ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39
[2025-05-31 09:17:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:17:19] [INFO ] After 148ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :39
TRAPS : Iteration 0
[2025-05-31 09:17:21] [INFO ] After 1903ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:39
[2025-05-31 09:17:21] [INFO ] After 2201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2025-05-31 09:17:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:17:21] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2025-05-31 09:17:21] [INFO ] After 180ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :39
TRAPS : Iteration 0
[2025-05-31 09:17:21] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2025-05-31 09:17:21] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-05-31 09:17:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2025-05-31 09:17:22] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2025-05-31 09:17:22] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2025-05-31 09:17:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2025-05-31 09:17:23] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 3 ms to minimize.
[2025-05-31 09:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
TRAPS : Iteration 1
[2025-05-31 09:17:24] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 4 ms to minimize.
[2025-05-31 09:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
TRAPS : Iteration 2
[2025-05-31 09:17:26] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 4 ms to minimize.
[2025-05-31 09:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
TRAPS : Iteration 3
[2025-05-31 09:17:29] [INFO ] After 8173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :39
[2025-05-31 09:17:29] [INFO ] After 8850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :39
RANDOM walk for 150 steps (2 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1282 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (280 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 838296 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 838296 steps, saw 231088 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
[2025-05-31 09:17:33] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:17:33] [INFO ] Invariant cache hit.
[2025-05-31 09:17:33] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 184 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 184 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 180 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 180 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 447
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 162 transition count 453
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 66 place count 159 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 159 transition count 441
Applied a total of 72 rules in 143 ms. Remains 159 /189 variables (removed 30) and now considering 441/511 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 159/189 places, 441/511 transitions.
RANDOM walk for 40000 steps (1265 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (286 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 863762 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 1
Probabilistic random walk after 863762 steps, saw 253173 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
[2025-05-31 09:17:37] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 159 cols
[2025-05-31 09:17:37] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:17:37] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/385 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/386 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/545 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/561 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/563 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/563 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/385 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/545 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/545 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/561 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/561 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/563 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 785ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 16 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 159/159 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 14 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2025-05-31 09:17:38] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:17:38] [INFO ] Invariant cache hit.
[2025-05-31 09:17:38] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-31 09:17:38] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:17:38] [INFO ] Invariant cache hit.
[2025-05-31 09:17:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 09:17:39] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2025-05-31 09:17:39] [INFO ] Redundant transitions in 5 ms returned []
Running 435 sub problems to find dead transitions.
[2025-05-31 09:17:39] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:17:39] [INFO ] Invariant cache hit.
[2025-05-31 09:17:39] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:17:42] [INFO ] Deduced a trap composed of 59 places in 256 ms of which 3 ms to minimize.
[2025-05-31 09:17:42] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 3 ms to minimize.
[2025-05-31 09:17:43] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
[2025-05-31 09:17:43] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2025-05-31 09:17:43] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2025-05-31 09:17:44] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 2 ms to minimize.
[2025-05-31 09:17:45] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 2 ms to minimize.
[2025-05-31 09:17:45] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2025-05-31 09:17:46] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2025-05-31 09:17:46] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 3 ms to minimize.
[2025-05-31 09:17:47] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 3 ms to minimize.
[2025-05-31 09:17:47] [INFO ] Deduced a trap composed of 103 places in 233 ms of which 3 ms to minimize.
[2025-05-31 09:17:47] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:17:49] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (OVERLAPS) 404/563 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:18:02] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2025-05-31 09:18:03] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 243 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:18:13] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (OVERLAPS) 404/563 variables, 159/183 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 435/679 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:18:25] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2025-05-31 09:18:33] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 681 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 19/19 constraints]
After SMT, in 60771ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61837 ms. Remains : 159/159 places, 441/441 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 7 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 239
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 130 transition count 224
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 121 transition count 221
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 121 transition count 221
Applied a total of 46 rules in 95 ms. Remains 121 /159 variables (removed 38) and now considering 221/441 (removed 220) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:18:39] [INFO ] Flow matrix only has 219 transitions (discarded 2 similar events)
// Phase 1: matrix 219 rows 121 cols
[2025-05-31 09:18:39] [INFO ] Computed 7 invariants in 11 ms
[2025-05-31 09:18:40] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 09:18:40] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:18:40] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 09:18:40] [INFO ] After 216ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:18:40] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:18:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 09:18:40] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:18:40] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2025-05-31 09:18:40] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2025-05-31 09:18:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
TRAPS : Iteration 1
[2025-05-31 09:18:40] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:18:40] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 800 ms.
RANDOM walk for 241 steps (7 resets) in 4 ms. (48 steps per ms) remains 0/1 properties
RANDOM walk for 1339 steps (43 resets) in 10 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1265 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (287 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 844605 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 1
Probabilistic random walk after 844605 steps, saw 233023 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
[2025-05-31 09:18:43] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:18:43] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:18:43] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 486
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 444
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 161 transition count 450
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 68 place count 158 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 438
Applied a total of 74 rules in 109 ms. Remains 158 /189 variables (removed 31) and now considering 438/511 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 158/189 places, 438/511 transitions.
RANDOM walk for 40000 steps (1295 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (277 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 900873 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 1
Probabilistic random walk after 900873 steps, saw 263410 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
[2025-05-31 09:18:47] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 158 cols
[2025-05-31 09:18:47] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:18:47] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/541 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/557 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/559 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/541 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/557 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/559 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/559 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-05-31 09:18:48] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:18:48] [INFO ] Invariant cache hit.
[2025-05-31 09:18:48] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-31 09:18:48] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:18:48] [INFO ] Invariant cache hit.
[2025-05-31 09:18:48] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 09:18:48] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2025-05-31 09:18:48] [INFO ] Redundant transitions in 5 ms returned []
Running 432 sub problems to find dead transitions.
[2025-05-31 09:18:48] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:18:48] [INFO ] Invariant cache hit.
[2025-05-31 09:18:48] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:18:52] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 3 ms to minimize.
[2025-05-31 09:18:52] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:18:53] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 3 ms to minimize.
[2025-05-31 09:18:53] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 3 ms to minimize.
[2025-05-31 09:18:53] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2025-05-31 09:18:53] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2025-05-31 09:18:55] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2025-05-31 09:18:55] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2025-05-31 09:18:56] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2025-05-31 09:18:57] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:19:09] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:19:12] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2025-05-31 09:19:17] [INFO ] Deduced a trap composed of 38 places in 54 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")
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 238 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 432/670 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:19:30] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2025-05-31 09:19:36] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 672 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints]
After SMT, in 60722ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61503 ms. Remains : 158/158 places, 438/438 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 158 vertex of which 29 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 132 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 130 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 129 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 237
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 129 transition count 222
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 120 transition count 219
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 120 transition count 219
Applied a total of 46 rules in 56 ms. Remains 120 /158 variables (removed 38) and now considering 219/438 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:19:49] [INFO ] Flow matrix only has 217 transitions (discarded 2 similar events)
// Phase 1: matrix 217 rows 120 cols
[2025-05-31 09:19:49] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:19:49] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:19:49] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:19:49] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 09:19:49] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:19:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-05-31 09:19:50] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:19:50] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:19:50] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 595 ms.
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1256 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (281 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 791873 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 791873 steps, saw 218160 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2025-05-31 09:19:53] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:19:53] [INFO ] Computed 7 invariants in 8 ms
[2025-05-31 09:19:53] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6947 steps, including 706 resets, run visited all 1 properties in 25 ms. (steps per millisecond=277 )
Parikh walk visited 1 properties in 35 ms.
RANDOM walk for 40000 steps (1271 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 869181 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :0 out of 1
Probabilistic random walk after 869181 steps, saw 239888 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
[2025-05-31 09:19:57] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:19:57] [INFO ] Invariant cache hit.
[2025-05-31 09:19:57] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 703ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 439
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 159 transition count 445
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 156 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 156 transition count 433
Applied a total of 78 rules in 91 ms. Remains 156 /189 variables (removed 33) and now considering 433/511 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 156/189 places, 433/511 transitions.
RANDOM walk for 40000 steps (1324 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (277 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 910817 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 1
Probabilistic random walk after 910817 steps, saw 266754 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
[2025-05-31 09:20:01] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
// Phase 1: matrix 396 rows 156 cols
[2025-05-31 09:20:01] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:20:01] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/374 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/375 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/534 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/550 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/552 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/374 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/375 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/534 variables, 79/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/550 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/552 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/552 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 156/156 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2025-05-31 09:20:01] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:20:01] [INFO ] Invariant cache hit.
[2025-05-31 09:20:02] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-31 09:20:02] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:20:02] [INFO ] Invariant cache hit.
[2025-05-31 09:20:02] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 09:20:02] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2025-05-31 09:20:02] [INFO ] Redundant transitions in 5 ms returned []
Running 427 sub problems to find dead transitions.
[2025-05-31 09:20:02] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:20:02] [INFO ] Invariant cache hit.
[2025-05-31 09:20:02] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:20:06] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 3 ms to minimize.
[2025-05-31 09:20:06] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-05-31 09:20:06] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2025-05-31 09:20:07] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 3 ms to minimize.
[2025-05-31 09:20:08] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2025-05-31 09:20:09] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 2 ms to minimize.
[2025-05-31 09:20:10] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2025-05-31 09:20:10] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:20:13] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 396/552 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:20:32] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 232 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 396/552 variables, 156/173 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 59/232 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 427/659 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:20:49] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2025-05-31 09:20:50] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-05-31 09:20:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 3/662 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 662 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 13/13 constraints]
After SMT, in 60716ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61591 ms. Remains : 156/156 places, 433/433 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 138 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 233
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 218
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 215
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 215
Applied a total of 46 rules in 46 ms. Remains 118 /156 variables (removed 38) and now considering 215/433 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:21:03] [INFO ] Flow matrix only has 213 transitions (discarded 2 similar events)
// Phase 1: matrix 213 rows 118 cols
[2025-05-31 09:21:03] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:21:03] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:21:03] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:21:03] [INFO ] After 151ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 09:21:03] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 284 ms.
RANDOM walk for 40000 steps (1320 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (266 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 802650 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 802650 steps, saw 220606 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2025-05-31 09:21:06] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:21:06] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:21:06] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 158 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 74 place count 155 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 155 transition count 431
Applied a total of 80 rules in 73 ms. Remains 155 /189 variables (removed 34) and now considering 431/511 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 155/189 places, 431/511 transitions.
RANDOM walk for 40000 steps (1244 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (266 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 878925 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :0 out of 1
Probabilistic random walk after 878925 steps, saw 257826 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
[2025-05-31 09:21:10] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 155 cols
[2025-05-31 09:21:10] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:21:10] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/371 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/531 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/547 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/549 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/549 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/371 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/531 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/547 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/549 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/549 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 431/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 155/155 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 431/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2025-05-31 09:21:11] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:21:11] [INFO ] Invariant cache hit.
[2025-05-31 09:21:11] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-31 09:21:11] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:21:11] [INFO ] Invariant cache hit.
[2025-05-31 09:21:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 09:21:12] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2025-05-31 09:21:12] [INFO ] Redundant transitions in 5 ms returned []
Running 425 sub problems to find dead transitions.
[2025-05-31 09:21:12] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:21:12] [INFO ] Invariant cache hit.
[2025-05-31 09:21:12] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:21:16] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 4 ms to minimize.
[2025-05-31 09:21:16] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 3 ms to minimize.
[2025-05-31 09:21:16] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 3 ms to minimize.
[2025-05-31 09:21:16] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2025-05-31 09:21:17] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2025-05-31 09:21:18] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2025-05-31 09:21:18] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 2 ms to minimize.
[2025-05-31 09:21:19] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2025-05-31 09:21:20] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2025-05-31 09:21:20] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-05-31 09:21:20] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:21:21] [INFO ] Deduced a trap composed of 92 places in 244 ms of which 3 ms to minimize.
[2025-05-31 09:21:24] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 394/549 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:21:31] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 235 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 394/549 variables, 155/176 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 59/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 425/660 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:22:00] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2025-05-31 09:22:00] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2025-05-31 09:22:00] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 3/663 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 663 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 17/17 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61538 ms. Remains : 155/155 places, 431/431 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 138 edges and 155 vertex of which 29 / 155 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 129 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 128 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 127 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 126 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 126 transition count 231
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 126 transition count 216
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 117 transition count 213
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 117 transition count 213
Applied a total of 46 rules in 42 ms. Remains 117 /155 variables (removed 38) and now considering 213/431 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:22:13] [INFO ] Flow matrix only has 211 transitions (discarded 2 similar events)
// Phase 1: matrix 211 rows 117 cols
[2025-05-31 09:22:13] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:22:13] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:22:13] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:22:13] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 09:22:13] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
RANDOM walk for 40000 steps (1281 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (267 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 730296 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 730296 steps, saw 201412 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2025-05-31 09:22:16] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:22:16] [INFO ] Computed 7 invariants in 7 ms
[2025-05-31 09:22:16] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 438
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 434
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 157 transition count 440
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 76 place count 154 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 154 transition count 428
Applied a total of 82 rules in 79 ms. Remains 154 /189 variables (removed 35) and now considering 428/511 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 154/189 places, 428/511 transitions.
RANDOM walk for 40000 steps (1303 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (270 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 740938 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 740938 steps, saw 219165 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2025-05-31 09:22:20] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
// Phase 1: matrix 391 rows 154 cols
[2025-05-31 09:22:20] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:22:20] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/181 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/367 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/527 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/543 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/181 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/367 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/368 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/527 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 38/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/543 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/545 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/545 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 29 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 154/154 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 8 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2025-05-31 09:22:21] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 09:22:21] [INFO ] Invariant cache hit.
[2025-05-31 09:22:21] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-31 09:22:21] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 09:22:21] [INFO ] Invariant cache hit.
[2025-05-31 09:22:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 09:22:22] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2025-05-31 09:22:22] [INFO ] Redundant transitions in 6 ms returned []
Running 422 sub problems to find dead transitions.
[2025-05-31 09:22:22] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 09:22:22] [INFO ] Invariant cache hit.
[2025-05-31 09:22:22] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:22:26] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 3 ms to minimize.
[2025-05-31 09:22:26] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 3 ms to minimize.
[2025-05-31 09:22:26] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 3 ms to minimize.
[2025-05-31 09:22:26] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-05-31 09:22:27] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 2 ms to minimize.
[2025-05-31 09:22:28] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-05-31 09:22:28] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2025-05-31 09:22:28] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2025-05-31 09:22:29] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 2 ms to minimize.
[2025-05-31 09:22:29] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2025-05-31 09:22:30] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:22:33] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 391/545 variables, 154/173 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 58/231 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:22:44] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:22:51] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
[2025-05-31 09:22:51] [INFO ] Deduced a trap composed of 42 places in 57 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 Real declared 545/545 variables, and 234 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:22:56] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:22:57] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 391/545 variables, 154/178 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 58/236 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 422/658 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:23:11] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2025-05-31 09:23:13] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 660 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 19/19 constraints]
After SMT, in 60712ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60720ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61619 ms. Remains : 154/154 places, 428/428 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 154 vertex of which 29 / 154 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 128 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 127 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 127 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 126 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 125 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 125 transition count 229
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 125 transition count 214
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 116 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 116 transition count 211
Applied a total of 46 rules in 40 ms. Remains 116 /154 variables (removed 38) and now considering 211/428 (removed 217) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:23:22] [INFO ] Flow matrix only has 209 transitions (discarded 2 similar events)
// Phase 1: matrix 209 rows 116 cols
[2025-05-31 09:23:22] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:23:23] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:23:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:23:23] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:23:23] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2025-05-31 09:23:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 1
[2025-05-31 09:23:23] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:23:23] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 560 ms.
RANDOM walk for 40000 steps (1292 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (281 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 729400 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 729400 steps, saw 201243 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2025-05-31 09:23:26] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:23:26] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:23:26] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 156 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 156 transition count 432
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 69 place count 156 transition count 438
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 78 place count 153 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 153 transition count 426
Applied a total of 84 rules in 62 ms. Remains 153 /189 variables (removed 36) and now considering 426/511 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 153/189 places, 426/511 transitions.
RANDOM walk for 40000 steps (1323 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (269 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 856322 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 1
Probabilistic random walk after 856322 steps, saw 251452 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2025-05-31 09:23:30] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 153 cols
[2025-05-31 09:23:30] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:23:30] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/364 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/524 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/540 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/542 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/542 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/542 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/364 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/365 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/524 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/540 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/540 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/542 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/542 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/542 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 426/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2025-05-31 09:23:30] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2025-05-31 09:23:30] [INFO ] Invariant cache hit.
[2025-05-31 09:23:31] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-31 09:23:31] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2025-05-31 09:23:31] [INFO ] Invariant cache hit.
[2025-05-31 09:23:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 09:23:31] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2025-05-31 09:23:31] [INFO ] Redundant transitions in 6 ms returned []
Running 420 sub problems to find dead transitions.
[2025-05-31 09:23:31] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2025-05-31 09:23:31] [INFO ] Invariant cache hit.
[2025-05-31 09:23:31] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:23:35] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 3 ms to minimize.
[2025-05-31 09:23:35] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2025-05-31 09:23:36] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 3 ms to minimize.
[2025-05-31 09:23:36] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
[2025-05-31 09:23:37] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2025-05-31 09:23:37] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2025-05-31 09:23:37] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2025-05-31 09:23:38] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 3 ms to minimize.
[2025-05-31 09:23:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2025-05-31 09:23:39] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-05-31 09:23:40] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/542 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:23:49] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:23:59] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2025-05-31 09:24:00] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/542 variables, and 232 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/542 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 420/652 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 652 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 60727ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61704 ms. Remains : 153/153 places, 426/426 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 153 vertex of which 29 / 153 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 127 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 126 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 126 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 125 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 124 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 227
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 124 transition count 212
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 115 transition count 209
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 115 transition count 209
Applied a total of 46 rules in 35 ms. Remains 115 /153 variables (removed 38) and now considering 209/426 (removed 217) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:24:32] [INFO ] Flow matrix only has 207 transitions (discarded 2 similar events)
// Phase 1: matrix 207 rows 115 cols
[2025-05-31 09:24:32] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:24:32] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:24:32] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:24:32] [INFO ] After 149ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 09:24:32] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
RANDOM walk for 40000 steps (1296 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (265 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 834478 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 834478 steps, saw 229956 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2025-05-31 09:24:36] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:24:36] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:24:36] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 09:24:36] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/664 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/664 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/666 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 155 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 155 transition count 429
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 155 transition count 435
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 80 place count 152 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 152 transition count 423
Applied a total of 86 rules in 60 ms. Remains 152 /189 variables (removed 37) and now considering 423/511 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 152/189 places, 423/511 transitions.
RANDOM walk for 40000 steps (1266 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (269 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 942504 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 1
Probabilistic random walk after 942504 steps, saw 276883 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
[2025-05-31 09:24:40] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
// Phase 1: matrix 386 rows 152 cols
[2025-05-31 09:24:40] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:24:40] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/174 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/360 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/361 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/520 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/536 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/538 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/174 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/360 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/361 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/520 variables, 79/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/536 variables, 10/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/538 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/538 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/538 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 423/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 152/152 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 423/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2025-05-31 09:24:40] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2025-05-31 09:24:40] [INFO ] Invariant cache hit.
[2025-05-31 09:24:41] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-05-31 09:24:41] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2025-05-31 09:24:41] [INFO ] Invariant cache hit.
[2025-05-31 09:24:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 09:24:41] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
[2025-05-31 09:24:41] [INFO ] Redundant transitions in 5 ms returned []
Running 417 sub problems to find dead transitions.
[2025-05-31 09:24:41] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2025-05-31 09:24:41] [INFO ] Invariant cache hit.
[2025-05-31 09:24:41] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:24:45] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2025-05-31 09:24:45] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2025-05-31 09:24:45] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 3 ms to minimize.
[2025-05-31 09:24:46] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2025-05-31 09:24:46] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:24:47] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 2 ms to minimize.
[2025-05-31 09:24:47] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2025-05-31 09:24:47] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-05-31 09:24:48] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-05-31 09:24:48] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2025-05-31 09:24:49] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 2 ms to minimize.
[2025-05-31 09:24:49] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:24:50] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:24:56] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 386/538 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:25:09] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 12 ms to minimize.
[2025-05-31 09:25:10] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 232 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 386/538 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 417/649 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:25:30] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2025-05-31 09:25:32] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2025-05-31 09:25:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 652 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 19/19 constraints]
After SMT, in 60634ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61582 ms. Remains : 152/152 places, 423/423 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 152 vertex of which 29 / 152 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 126 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 125 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 124 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 123 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 123 transition count 225
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 123 transition count 210
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 114 transition count 207
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 114 transition count 207
Applied a total of 46 rules in 40 ms. Remains 114 /152 variables (removed 38) and now considering 207/423 (removed 216) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:25:42] [INFO ] Flow matrix only has 205 transitions (discarded 2 similar events)
// Phase 1: matrix 205 rows 114 cols
[2025-05-31 09:25:42] [INFO ] Computed 7 invariants in 18 ms
[2025-05-31 09:25:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:25:42] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:25:42] [INFO ] After 147ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:25:42] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:25:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:25:42] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:25:42] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:25:42] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 491 ms.
RANDOM walk for 40000 steps (1310 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (285 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 670893 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 670893 steps, saw 185343 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2025-05-31 09:25:46] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:25:46] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:25:46] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 09:25:46] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/664 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/664 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/666 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1188ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 156 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 156 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 154 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 154 transition count 427
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 154 transition count 433
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 82 place count 151 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 151 transition count 421
Applied a total of 88 rules in 59 ms. Remains 151 /189 variables (removed 38) and now considering 421/511 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 151/189 places, 421/511 transitions.
RANDOM walk for 40000 steps (1314 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (287 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 968693 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 968693 steps, saw 284032 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
[2025-05-31 09:25:50] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2025-05-31 09:25:50] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:25:50] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 128/171 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/357 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/358 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/517 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/517 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/517 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/533 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 128/171 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/357 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/358 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/517 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/517 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/517 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 475ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2025-05-31 09:25:50] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 09:25:50] [INFO ] Invariant cache hit.
[2025-05-31 09:25:51] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-31 09:25:51] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 09:25:51] [INFO ] Invariant cache hit.
[2025-05-31 09:25:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 09:25:51] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2025-05-31 09:25:51] [INFO ] Redundant transitions in 5 ms returned []
Running 415 sub problems to find dead transitions.
[2025-05-31 09:25:51] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 09:25:51] [INFO ] Invariant cache hit.
[2025-05-31 09:25:51] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:25:55] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 3 ms to minimize.
[2025-05-31 09:25:55] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2025-05-31 09:25:55] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 2 ms to minimize.
[2025-05-31 09:25:56] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2025-05-31 09:25:56] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-05-31 09:25:57] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2025-05-31 09:25:57] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2025-05-31 09:25:58] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2025-05-31 09:25:58] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2025-05-31 09:25:58] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2025-05-31 09:25:59] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:26:02] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 384/535 variables, 151/170 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:26:13] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-05-31 09:26:13] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:26:20] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 230 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/535 variables, 151/173 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 415/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:26:51] [INFO ] Deduced a trap composed of 42 places in 64 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 535/535 variables, and 646 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
After SMT, in 60696ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60704ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61664 ms. Remains : 151/151 places, 421/421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 125 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 124 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 223
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 122 transition count 208
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 113 transition count 205
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 113 transition count 205
Applied a total of 46 rules in 33 ms. Remains 113 /151 variables (removed 38) and now considering 205/421 (removed 216) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:26:52] [INFO ] Flow matrix only has 203 transitions (discarded 2 similar events)
// Phase 1: matrix 203 rows 113 cols
[2025-05-31 09:26:52] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:26:52] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:26:52] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:26:52] [INFO ] After 156ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 09:26:52] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 271 ms.
RANDOM walk for 40000 steps (1251 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (256 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 691670 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 691670 steps, saw 189752 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2025-05-31 09:26:55] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:26:55] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:26:55] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 155 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 155 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 153 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 153 transition count 424
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 153 transition count 430
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 84 place count 150 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 150 transition count 418
Applied a total of 90 rules in 67 ms. Remains 150 /189 variables (removed 39) and now considering 418/511 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 150/189 places, 418/511 transitions.
RANDOM walk for 40000 steps (1256 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (257 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 929180 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 1
Probabilistic random walk after 929180 steps, saw 272407 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
[2025-05-31 09:26:59] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
// Phase 1: matrix 381 rows 150 cols
[2025-05-31 09:26:59] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:26:59] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/167 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/353 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/354 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/513 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/529 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/531 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/167 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/353 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/513 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/513 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/529 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/531 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 150/150 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2025-05-31 09:27:00] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2025-05-31 09:27:00] [INFO ] Invariant cache hit.
[2025-05-31 09:27:00] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-31 09:27:00] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2025-05-31 09:27:00] [INFO ] Invariant cache hit.
[2025-05-31 09:27:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 09:27:01] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2025-05-31 09:27:01] [INFO ] Redundant transitions in 6 ms returned []
Running 412 sub problems to find dead transitions.
[2025-05-31 09:27:01] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2025-05-31 09:27:01] [INFO ] Invariant cache hit.
[2025-05-31 09:27:01] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:27:04] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 3 ms to minimize.
[2025-05-31 09:27:04] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 2 ms to minimize.
[2025-05-31 09:27:05] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 2 ms to minimize.
[2025-05-31 09:27:05] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-05-31 09:27:06] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
[2025-05-31 09:27:06] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
[2025-05-31 09:27:06] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-05-31 09:27:06] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 2 ms to minimize.
[2025-05-31 09:27:07] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 3 ms to minimize.
[2025-05-31 09:27:07] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-05-31 09:27:08] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 2 ms to minimize.
[2025-05-31 09:27:09] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 381/531 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:27:24] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2025-05-31 09:27:24] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
[2025-05-31 09:27:24] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2025-05-31 09:27:28] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-05-31 09:27:28] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/531 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/531 variables, and 230 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 381/531 variables, 150/174 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 412/642 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:28:00] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/531 variables, and 643 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 18/18 constraints]
After SMT, in 60615ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61519 ms. Remains : 150/150 places, 418/418 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 150 vertex of which 29 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 124 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 123 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 122 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 221
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 121 transition count 206
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 112 transition count 203
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 112 transition count 203
Applied a total of 46 rules in 33 ms. Remains 112 /150 variables (removed 38) and now considering 203/418 (removed 215) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:28:01] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 112 cols
[2025-05-31 09:28:01] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 09:28:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:28:02] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:28:02] [INFO ] After 140ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 09:28:02] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 253 ms.
RANDOM walk for 40000 steps (1233 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (279 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 786412 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 786412 steps, saw 216465 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2025-05-31 09:28:05] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:28:05] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:28:05] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 871ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 156 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 156 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 154 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 154 transition count 426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 152 transition count 422
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 152 transition count 422
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 152 transition count 428
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 86 place count 149 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 149 transition count 416
Applied a total of 92 rules in 66 ms. Remains 149 /189 variables (removed 40) and now considering 416/511 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 149/189 places, 416/511 transitions.
RANDOM walk for 40000 steps (1267 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (292 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 877926 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :0 out of 1
Probabilistic random walk after 877926 steps, saw 257535 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
[2025-05-31 09:28:09] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 149 cols
[2025-05-31 09:28:09] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:28:09] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/164 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/350 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/351 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/510 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/526 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/528 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/164 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/350 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/351 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/510 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/526 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/528 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 149/149 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2025-05-31 09:28:09] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2025-05-31 09:28:09] [INFO ] Invariant cache hit.
[2025-05-31 09:28:09] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-31 09:28:09] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2025-05-31 09:28:09] [INFO ] Invariant cache hit.
[2025-05-31 09:28:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 09:28:10] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2025-05-31 09:28:10] [INFO ] Redundant transitions in 5 ms returned []
Running 410 sub problems to find dead transitions.
[2025-05-31 09:28:10] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2025-05-31 09:28:10] [INFO ] Invariant cache hit.
[2025-05-31 09:28:10] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:28:13] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 2 ms to minimize.
[2025-05-31 09:28:14] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2025-05-31 09:28:14] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 5 ms to minimize.
[2025-05-31 09:28:15] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2025-05-31 09:28:15] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2025-05-31 09:28:15] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 2 ms to minimize.
[2025-05-31 09:28:16] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2025-05-31 09:28:16] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 09:28:17] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2025-05-31 09:28:17] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/166 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:28:29] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:28:31] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2025-05-31 09:28:35] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 225 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/169 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 410/635 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:28:56] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 410 unsolved
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 QuasiLiveness -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="FireWire-PT-14"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-14, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-smll-174860112300217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;