About the Execution of 2024-gold for ASLink-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15696.460 | 1800000.00 | 2722512.00 | 3538.50 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r014-tall-174853743600243.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 ASLink-PT-07b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743600243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K 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 64K 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.9K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 StableMarking
=== Now, execution of the tool begins
BK_START 1748547145077
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 19:32:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 19:32:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:32:26] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2025-05-29 19:32:26] [INFO ] Transformed 3222 places.
[2025-05-29 19:32:26] [INFO ] Transformed 3986 transitions.
[2025-05-29 19:32:26] [INFO ] Found NUPN structural information;
[2025-05-29 19:32:26] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 393 ms.
Structural test allowed to assert that 396 places are NOT stable. Took 25 ms.
RANDOM walk for 40000 steps (58 resets) in 5649 ms. (7 steps per ms) remains 1081/2826 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 54 ms. (2 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 35 ms. (3 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 29 ms. (4 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 121 steps (8 resets) in 20 ms. (5 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 121 steps (8 resets) in 11 ms. (10 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 122 steps (8 resets) in 19 ms. (6 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1081/1081 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1081/1081 properties
// Phase 1: matrix 3986 rows 3222 cols
[2025-05-29 19:32:28] [INFO ] Computed 316 invariants in 136 ms
Error getting values : (error "ParserException while parsing response: ((s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s18 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s44 (/ 1.0 2.0))
(s45 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s54 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s199 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s265 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s283 (/ 1.0 2.0))
(s284 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s287 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s317 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s324 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s354 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s360 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s409 (/ 1.0 2.0))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s413 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s419 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s421 (/ 1.0 2.0))
(s422 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s426 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s510 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s512 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s520 (/ 1.0 2.0))
(s521 (/ 1.0 2.0))
(s522 (/ 1.0 2.0))
(s523 (/ 1.0 2.0))
(s524 (/ 1.0 2.0))
(s528 (/ 1.0 2.0))
(s529 (/ 1.0 2.0))
(s530 (/ 1.0 2.0))
(s531 (/ 1.0 2.0))
(s532 (/ 1.0 2.0))
(s533 (/ 1.0 2.0))
(s534 (/ 1.0 2.0))
(s535 (/ 1.0 2.0))
(s536 (/ 1.0 2.0))
(s537 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s556 (/ 1.0 2.0))
(s557 (/ 1.0 2.0))
(s558 (/ 1.0 2.0))
(s559 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s562 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 (/ 1.0 2.0))
(s568 (/ 1.0 2.0))
(s569 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s571 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 (/ 1.0 2.0))
(s579 (/ 1.0 2.0))
(s580 (/ 1.0 2.0))
(s581 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s584 (/ 1.0 2.0))
(s585 (/ 1.0 2.0))
(s587 (/ 1.0 2.0))
(s588 (/ 1.0 2.0))
(s596 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s603 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s605 (/ 1.0 2.0))
(s606 (/ 1.0 2.0))
(s607 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s609 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s613 (/ 1.0 2.0))
(s614 (/ 1.0 2.0))
(s615 (/ 1.0 2.0))
(s616 (/ 1.0 2.0))
(s617 (/ 1.0 2.0))
(s618 (/ 1.0 2.0))
(s619 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s637 (/ 1.0 2.0))
(s638 (/ 1.0 2.0))
(s639 (/ 1.0 2.0))
(s640 (/ 1.0 2.0))
(s641 (/ 1.0 2.0))
(s642 (/ 1.0 2.0))
(s643 (/ 1.0 2.0))
(s644 (/ 1.0 2.0))
(s645 (/ 1.0 2.0))
(s646 (/ 1.0 2.0))
(s647 (/ 1.0 2.0))
(s648 (/ 1.0 2.0))
(s649 (/ 1.0 2.0))
(s650 (/ 1.0 2.0))
(s651 (/ 1.0 2.0))
(s652 (/ 1.0 2.0))
(s653 (/ 1.0 2.0))
(s654 (/ 1.0 2.0))
(s655 (/ 1.0 2.0))
(s656 (/ 1.0 2.0))
(s657 (/ 1.0 2.0))
(s658 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s660 (/ 1.0 2.0))
(s661 (/ 1.0 2.0))
(s662 (/ 1.0 2.0))
(s663 (/ 1.0 2.0))
(s664 (/ 1.0 2.0))
(s665 (/ 1.0 2.0))
(s666 (/ 1.0 2.0))
(s667 (/ 1.0 2.0))
(s669 (/ 1.0 2.0))
(s670 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s673 (/ 1.0 2.0))
(s674 (/ 1.0 2.0))
(s675 (/ 1.0 2.0))
(s676 (/ 1.0 2.0))
(s677 (/ 1.0 2.0))
(s678 (/ 1.0 2.0))
(s679 (/ 1.0 2.0))
(s680 (/ 1.0 2.0))
(s681 (/ 1.0 2.0))
(s682 (/ 1.0 2.0))
(s683 (/ 1.0 2.0))
(s684 (/ 1.0 2.0))
(s716 (/ 1.0 2.0))
(s717 (/ 1.0 2.0))
(s718 (/ 1.0 2.0))
(s719 (/ 1.0 2.0))
(s720 (/ 1.0 2.0))
(s721 (/ 1.0 2.0))
(s753 (/ 1.0 2.0))
(s754 (/ 1.0 2.0))
(s755 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s799 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s801 (/ 1.0 2.0))
(s802 (/ 1.0 2.0))
(s803 (/ 1.0 2.0))
(s804 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s809 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s844 (/ 1.0 2.0))
(s845 (/ 1.0 2.0))
(s846 (/ 1.0 2.0))
(s853 (/ 1.0 2.0))
(s854 (/ 1.0 2.0))
(s855 (/ 1.0 2.0))
(s859 (/ 1.0 2.0))
(s860 (/ 1.0 2.0))
(s861 (/ 1.0 2.0))
(s865 (/ 1.0 2.0))
(s866 (/ 1.0 2.0))
(s867 (/ 1.0 2.0))
(s882 (/ 1.0 2.0))
(s883 (/ 1.0 2.0))
(s884 (/ 1.0 2.0))
(s885 (/ 1.0 2.0))
(s886 (/ 1.0 2.0))
(s887 (/ 1.0 2.0))
(s888 (/ 1.0 2.0))
(s889 (/ 1.0 2.0))
(s890 (/ 1.0 2.0))
(s891 (/ 1.0 2.0))
(s892 (/ 1.0 2.0))
(s893 (/ 1.0 2.0))
(s894 (/ 1.0 2.0))
(s895 (/ 1.0 2.0))
(s896 (/ 1.0 2.0))
(s897 (/ 1.0 2.0))
(s898 (/ 1.0 2.0))
(s899 (/ 1.0 2.0))
(s900 (/ 1.0 2.0))
(s901 (/ 1.0 2.0))
(s902 (/ 1.0 2.0))
(s903 (/ 1.0 2.0))
(s904 (/ 1.0 2.0))
(s905 (/ 1.0 2.0))
(s906 (/ 1.0 2.0))
(s907 (/ 1.0 2.0))
(s908 (/ 1.0 2.0))
(s909 (/ 1.0 2.0))
(s910 (/ 1.0 2.0))
(s911 (/ 1.0 2.0))
(s912 (/ 1.0 2.0))
(s913 (/ 1.0 2.0))
(s914 (/ 1.0 2.0))
(s915 (/ 1.0 2.0))
(s916 (/ 1.0 2.0))
(s917 (/ 1.0 2.0))
(s918 (/ 1.0 2.0))
(s919 (/ 1.0 2.0))
(s923 (/ 1.0 2.0))
(s924 (/ 1.0 2.0))
(s925 (/ 1.0 2.0))
(s926 (/ 1.0 2.0))
(s927 (/ 1.0 2.0))
(s928 (/ 1.0 2.0))
(s951 (/ 1.0 2.0))
(s952 (/ 1.0 2.0))
(s953 (/ 1.0 2.0))
(s954 (/ 1.0 2.0))
(s955 (/ 1.0 2.0))
(s956 (/ 1.0 2.0))
(s957 (/ 1.0 2.0))
(s958 (/ 1.0 2.0))
(s959 (/ 1.0 2.0))
(s960 (/ 1.0 2.0))
(s961 (/ 1.0 2.0))
(s962 (/ 1.0 2.0))
(s963 (/ 1.0 2.0))
(s964 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 1081/1081 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
SMT process timed out in 5922ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1081 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 511 transitions
Trivial Post-agglo rules discarded 511 transitions
Performed 511 trivial Post agglomeration. Transition count delta: 511
Iterating post reduction 0 with 511 rules applied. Total rules applied 511 place count 3222 transition count 3475
Reduce places removed 511 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 539 rules applied. Total rules applied 1050 place count 2711 transition count 3447
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1056 place count 2705 transition count 3447
Performed 480 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 480 Pre rules applied. Total rules applied 1056 place count 2705 transition count 2967
Deduced a syphon composed of 480 places in 9 ms
Ensure Unique test removed 41 places
Reduce places removed 521 places and 0 transitions.
Iterating global reduction 3 with 1001 rules applied. Total rules applied 2057 place count 2184 transition count 2967
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 26 rules applied. Total rules applied 2083 place count 2178 transition count 2947
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2103 place count 2158 transition count 2947
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 2103 place count 2158 transition count 2925
Deduced a syphon composed of 22 places in 26 ms
Ensure Unique test removed 22 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 2169 place count 2114 transition count 2925
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 2169 place count 2114 transition count 2903
Deduced a syphon composed of 22 places in 25 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 2213 place count 2092 transition count 2903
Discarding 56 places :
Symmetric choice reduction at 5 with 56 rule applications. Total rules 2269 place count 2036 transition count 2847
Iterating global reduction 5 with 56 rules applied. Total rules applied 2325 place count 2036 transition count 2847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2326 place count 2036 transition count 2846
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 2326 place count 2036 transition count 2836
Deduced a syphon composed of 10 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 2347 place count 2025 transition count 2836
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2347 place count 2025 transition count 2835
Deduced a syphon composed of 1 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 2350 place count 2023 transition count 2835
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2353 place count 2020 transition count 2814
Iterating global reduction 6 with 3 rules applied. Total rules applied 2356 place count 2020 transition count 2814
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2356 place count 2020 transition count 2813
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2358 place count 2019 transition count 2813
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2359 place count 2018 transition count 2805
Iterating global reduction 6 with 1 rules applied. Total rules applied 2360 place count 2018 transition count 2805
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2361 place count 2017 transition count 2797
Iterating global reduction 6 with 1 rules applied. Total rules applied 2362 place count 2017 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2363 place count 2016 transition count 2789
Iterating global reduction 6 with 1 rules applied. Total rules applied 2364 place count 2016 transition count 2789
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2365 place count 2015 transition count 2781
Iterating global reduction 6 with 1 rules applied. Total rules applied 2366 place count 2015 transition count 2781
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2367 place count 2014 transition count 2773
Iterating global reduction 6 with 1 rules applied. Total rules applied 2368 place count 2014 transition count 2773
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2369 place count 2013 transition count 2765
Iterating global reduction 6 with 1 rules applied. Total rules applied 2370 place count 2013 transition count 2765
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2371 place count 2012 transition count 2757
Iterating global reduction 6 with 1 rules applied. Total rules applied 2372 place count 2012 transition count 2757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2373 place count 2011 transition count 2749
Iterating global reduction 6 with 1 rules applied. Total rules applied 2374 place count 2011 transition count 2749
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2375 place count 2010 transition count 2741
Iterating global reduction 6 with 1 rules applied. Total rules applied 2376 place count 2010 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2377 place count 2009 transition count 2733
Iterating global reduction 6 with 1 rules applied. Total rules applied 2378 place count 2009 transition count 2733
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2379 place count 2008 transition count 2725
Iterating global reduction 6 with 1 rules applied. Total rules applied 2380 place count 2008 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2381 place count 2007 transition count 2717
Iterating global reduction 6 with 1 rules applied. Total rules applied 2382 place count 2007 transition count 2717
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2383 place count 2006 transition count 2709
Iterating global reduction 6 with 1 rules applied. Total rules applied 2384 place count 2006 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2385 place count 2005 transition count 2701
Iterating global reduction 6 with 1 rules applied. Total rules applied 2386 place count 2005 transition count 2701
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2387 place count 2004 transition count 2693
Iterating global reduction 6 with 1 rules applied. Total rules applied 2388 place count 2004 transition count 2693
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2389 place count 2003 transition count 2685
Iterating global reduction 6 with 1 rules applied. Total rules applied 2390 place count 2003 transition count 2685
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 18 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 6 with 318 rules applied. Total rules applied 2708 place count 1844 transition count 2526
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2710 place count 1843 transition count 2535
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 2723 place count 1843 transition count 2522
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2736 place count 1830 transition count 2522
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2741 place count 1830 transition count 2517
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2746 place count 1825 transition count 2517
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2749 place count 1825 transition count 2517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2750 place count 1824 transition count 2516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2751 place count 1823 transition count 2516
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 2751 place count 1823 transition count 2514
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2755 place count 1821 transition count 2514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2757 place count 1820 transition count 2513
Applied a total of 2757 rules in 2158 ms. Remains 1820 /3222 variables (removed 1402) and now considering 2513/3986 (removed 1473) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2174 ms. Remains : 1820/3222 places, 2513/3986 transitions.
RANDOM walk for 2197819 steps (19873 resets) in 120004 ms. (18 steps per ms) remains 879/1081 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 879/879 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 879/879 properties
// Phase 1: matrix 2513 rows 1820 cols
[2025-05-29 19:33:07] [INFO ] Computed 244 invariants in 59 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/879 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 95/974 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 72.0))
(s1 (/ 1.0 72.0))
(s2 (/ 13.0 72.0))
(s3 (/ 1.0 72.0))
(s4 (/ 1.0 72.0))
(s5 (/ 1.0 72.0))
(s6 (/ 1.0 72.0))
(s7 (/ 1.0 72.0))
(s8 (/ 1.0 72.0))
(s9 (/ 1.0 72.0))
(s10 (/ 1.0 72.0))
(s11 (/ 1.0 72.0))
(s12 (/ 1.0 72.0))
(s13 (/ 1.0 72.0))
(s14 (/ 1.0 72.0))
(s15 (/ 1.0 72.0))
(s16 (/ 1.0 72.0))
(s17 (/ 1.0 72.0))
(s18 (/ 1.0 72.0))
(s19 (/ 1.0 72.0))
(s20 (/ 1.0 72.0))
(s21 (/ 1.0 72.0))
(s22 (/ 1.0 72.0))
(s23 (/ 1.0 72.0))
(s24 (/ 1.0 72.0))
(s25 (/ 1.0 72.0))
(s26 (/ 1.0 72.0))
(s27 (/ 1.0 72.0))
(s28 (/ 1.0 72.0))
(s29 (/ 1.0 72.0))
(s30 (/ 1.0 72.0))
(s31 (/ 1.0 72.0))
(s32 (/ 1.0 72.0))
(s33 (/ 1.0 72.0))
(s34 (/ 1.0 72.0))
(s36 (/ 1.0 72.0))
(s37 (/ 1.0 24.0))
(s38 (/ 1.0 72.0))
(s39 (/ 5.0 6.0))
(s40 (/ 1.0 72.0))
(s41 (/ 1.0 12.0))
(s42 0.0)
(s44 (/ 1.0 72.0))
(s45 (/ 1.0 72.0))
(s46 (/ 1.0 72.0))
(s47 (/ 1.0 72.0))
(s48 (/ 1.0 72.0))
(s49 (/ 1.0 72.0))
(s50 (/ 1.0 72.0))
(s51 (/ 1.0 72.0))
(s52 (/ 1.0 72.0))
(s53 (/ 1.0 72.0))
(s54 (/ 1.0 72.0))
(s55 (/ 1.0 72.0))
(s56 (/ 1.0 72.0))
(s57 (/ 1.0 72.0))
(s58 (/ 1.0 72.0))
(s59 (/ 1.0 72.0))
(s60 (/ 1.0 72.0))
(s61 (/ 1.0 72.0))
(s62 (/ 1.0 72.0))
(s63 (/ 1.0 72.0))
(s64 (/ 1.0 72.0))
(s65 (/ 1.0 72.0))
(s66 (/ 1.0 72.0))
(s67 (/ 1.0 72.0))
(s68 (/ 1.0 72.0))
(s69 (/ 1.0 72.0))
(s70 (/ 1.0 72.0))
(s71 (/ 1.0 72.0))
(s72 (/ 1.0 72.0))
(s73 (/ 1.0 72.0))
(s74 (/ 1.0 72.0))
(s75 (/ 1.0 72.0))
(s76 (/ 1.0 72.0))
(s77 (/ 1.0 72.0))
(s78 (/ 1.0 72.0))
(s79 (/ 1.0 72.0))
(s80 (/ 1.0 72.0))
(s81 (/ 1.0 72.0))
(s82 (/ 1.0 72.0))
(s83 (/ 1.0 72.0))
(s84 (/ 1.0 72.0))
(s85 (/ 1.0 72.0))
(s86 (/ 1.0 72.0))
(s87 (/ 1.0 72.0))
(s88 (/ 1.0 72.0))
(s89 (/ 1.0 72.0))
(s90 (/ 1.0 72.0))
(s91 (/ 1.0 72.0))
(s92 (/ 1.0 72.0))
(s93 (/ 1.0 72.0))
(s94 (/ 1.0 72.0))
(s95 (/ 1.0 72.0))
(s96 (/ 1.0 72.0))
(s97 (/ 1.0 72.0))
(s98 (/ 1.0 72.0))
(s99 (/ 1.0 72.0))
(s100 (/ 1.0 72.0))
(s101 (/ 1.0 72.0))
(s102 (/ 1.0 72.0))
(s103 (/ 1.0 72.0))
(s104 (/ 1.0 72.0))
(s105 (/ 1.0 72.0))
(s106 (/ 1.0 72.0))
(s129 0.0)
(s130 (/ 19.0 36.0))
(s131 (/ 1.0 72.0))
(s132 (/ 1.0 72.0))
(s133 (/ 1.0 72.0))
(s134 (/ 1.0 72.0))
(s135 (/ 1.0 72.0))
(s136 (/ 1.0 72.0))
(s137 (/ 1.0 72.0))
(s138 (/ 1.0 72.0))
(s139 (/ 1.0 72.0))
(s140 (/ 1.0 72.0))
(s141 (/ 1.0 72.0))
(s142 (/ 1.0 72.0))
(s143 (/ 1.0 72.0))
(s144 (/ 1.0 72.0))
(s145 (/ 1.0 72.0))
(s146 (/ 1.0 72.0))
(s147 (/ 1.0 72.0))
(s148 (/ 1.0 72.0))
(s149 (/ 1.0 72.0))
(s150 (/ 1.0 72.0))
(s151 (/ 1.0 72.0))
(s152 (/ 1.0 72.0))
(s153 (/ 1.0 72.0))
(s154 (/ 1.0 8.0))
(s155 (/ 1.0 72.0))
(s156 (/ 1.0 72.0))
(s157 (/ 1.0 72.0))
(s158 (/ 1.0 72.0))
(s163 (/ 1.0 72.0))
(s164 (/ 1.0 72.0))
(s165 (/ 1.0 72.0))
(s166 (/ 1.0 72.0))
(s167 (/ 1.0 72.0))
(s168 (/ 1.0 72.0))
(s169 (/ 1.0 72.0))
(s170 (/ 1.0 72.0))
(s171 (/ 1.0 72.0))
(s172 (/ 1.0 72.0))
(s173 (/ 1.0 72.0))
(s174 (/ 1.0 72.0))
(s175 (/ 1.0 72.0))
(s176 (/ 1.0 72.0))
(s177 (/ 1.0 72.0))
(s178 (/ 1.0 72.0))
(s179 (/ 31.0 72.0))
(s180 (/ 1.0 72.0))
(s181 (/ 1.0 72.0))
(s182 (/ 1.0 72.0))
(s183 (/ 1.0 72.0))
(s184 (/ 1.0 72.0))
(s185 (/ 1.0 72.0))
(s191 (/ 1.0 72.0))
(s192 (/ 1.0 72.0))
(s193 (/ 1.0 72.0))
(s194 (/ 1.0 72.0))
(s195 (/ 1.0 72.0))
(s196 (/ 1.0 72.0))
(s197 (/ 1.0 72.0))
(s198 (/ 1.0 72.0))
(s199 (/ 1.0 72.0))
(s200 (/ 1.0 72.0))
(s201 (/ 1.0 72.0))
(s202 (/ 1.0 72.0))
(s203 (/ 1.0 72.0))
(s204 (/ 1.0 72.0))
(s205 (/ 1.0 72.0))
(s206 (/ 1.0 72.0))
(s207 (/ 1.0 72.0))
(s208 (/ 1.0 72.0))
(s209 (/ 1.0 72.0))
(s210 (/ 1.0 72.0))
(s211 (/ 1.0 72.0))
(s212 (/ 1.0 72.0))
(s213 (/ 1.0 72.0))
(s214 (/ 1.0 72.0))
(s215 (/ 31.0 36.0))
(s216 (/ 1.0 72.0))
(s217 (/ 1.0 72.0))
(s218 (/ 1.0 72.0))
(s219 (/ 1.0 72.0))
(s220 (/ 1.0 72.0))
(s221 (/ 31.0 36.0))
(s222 (/ 7.0 8.0))
(s223 (/ 1.0 72.0))
(s224 (/ 1.0 72.0))
(s225 (/ 1.0 72.0))
(s228 (/ 1.0 72.0))
(s229 (/ 1.0 72.0))
(s230 (/ 1.0 72.0))
(s231 (/ 1.0 72.0))
(s232 (/ 1.0 72.0))
(s233 (/ 1.0 72.0))
(s245 0.0)
(s262 0.0)
(s276 0.0)
(s278 0.0)
(s279 (/ 23.0 24.0))
(s281 0.0)
(s282 0.0)
(s284 (/ 1.0 72.0))
(s285 (/ 1.0 72.0))
(s286 (/ 1.0 72.0))
(s287 (/ 1.0 72.0))
(s288 (/ 1.0 72.0))
(s289 (/ 1.0 72.0))
(s290 (/ 1.0 72.0))
(s291 (/ 1.0 72.0))
(s292 (/ 1.0 72.0))
(s293 (/ 8.0 9.0))
(s294 (/ 1.0 72.0))
(s295 (/ 7.0 8.0))
(s296 (/ 1.0 72.0))
(s297 (/ 1.0 72.0))
(s298 (/ 1.0 72.0))
(s300 (/ 1.0 72.0))
(s301 (/ 1.0 72.0))
(s302 (/ 1.0 72.0))
(s303 (/ 1.0 72.0))
(s304 (/ 1.0 72.0))
(s305 (/ 1.0 72.0))
(s306 (/ 1.0 72.0))
(s307 (/ 1.0 72.0))
(s308 (/ 1.0 72.0))
(s309 (/ 1.0 72.0))
(s310 (/ 1.0 72.0))
(s311 (/ 1.0 72.0))
(s313 (/ 1.0 72.0))
(s314 (/ 1.0 72.0))
(s315 (/ 1.0 72.0))
(s316 (/ 1.0 72.0))
(s317 (/ 1.0 72.0))
(s318 (/ 1.0 72.0))
(s325 (/ 1.0 72.0))
(s326 (/ 1.0 72.0))
(s327 (/ 1.0 72.0))
(s328 (/ 23.0 24.0))
(s329 0.0)
(s330 (/ 1.0 72.0))
(s331 (/ 1.0 72.0))
(s332 (/ 8.0 9.0))
(s333 (/ 1.0 72.0))
(s334 (/ 1.0 72.0))
(s335 (/ 1.0 72.0))
(s336 (/ 1.0 72.0))
(s337 (/ 1.0 72.0))
(s338 (/ 1.0 72.0))
(s339 0.0)
(s340 (/ 1.0 72.0))
(s341 (/ 1.0 72.0))
(s342 (/ 1.0 72.0))
(s343 (/ 23.0 24.0))
(s344 0.0)
(s345 (/ 1.0 72.0))
(s346 (/ 1.0 72.0))
(s347 (/ 1.0 72.0))
(s348 (/ 1.0 72.0))
(s349 (/ 1.0 72.0))
(s350 (/ 1.0 72.0))
(s351 (/ 1.0 72.0))
(s352 (/ 1.0 72.0))
(s353 (/ 1.0 72.0))
(s354 (/ 1.0 72.0))
(s355 (/ 1.0 72.0))
(s356 (/ 1.0 72.0))
(s357 (/ 1.0 72.0))
(s358 (/ 1.0 72.0))
(s359 (/ 1.0 72.0))
(s360 (/ 1.0 72.0))
(s361 (/ 1.0 72.0))
(s362 (/ 1.0 72.0))
(s363 (/ 1.0 72.0))
(s364 (/ 1.0 72.0))
(s365 (/ 1.0 72.0))
(s366 (/ 1.0 72.0))
(s367 (/ 1.0 72.0))
(s368 (/ 1.0 72.0))
(s369 (/ 1.0 72.0))
(s370 (/ 1.0 72.0))
(s371 (/ 1.0 72.0))
(s372 (/ 1.0 72.0))
(s373 (/ 1.0 72.0))
(s374 (/ 1.0 72.0))
(s375 (/ 1.0 72.0))
(s376 (/ 1.0 72.0))
(s377 (/ 1.0 72.0))
(s378 (/ 1.0 72.0))
(s379 (/ 1.0 72.0))
(s380 (/ 1.0 72.0))
(s381 (/ 1.0 72.0))
(s382 (/ 1.0 72.0))
(s384 0.0)
(s385 0.0)
(s407 (/ 37.0 72.0))
(s408 (/ 1.0 72.0))
(s409 (/ 1.0 72.0))
(s410 (/ 1.0 72.0))
(s411 (/ 1.0 72.0))
(s412 (/ 1.0 72.0))
(s413 (/ 1.0 72.0))
(s414 (/ 1.0 72.0))
(s415 (/ 1.0 72.0))
(s416 (/ 1.0 72.0))
(s417 (/ 1.0 72.0))
(s418 (/ 1.0 72.0))
(s419 (/ 1.0 72.0))
(s420 (/ 1.0 72.0))
(s421 (/ 1.0 72.0))
(s422 (/ 1.0 72.0))
(s423 (/ 1.0 72.0))
(s424 (/ 1.0 72.0))
(s425 (/ 1.0 72.0))
(s426 (/ 1.0 72.0))
(s427 (/ 1.0 72.0))
(s428 (/ 1.0 72.0))
(s429 (/ 1.0 72.0))
(s430 (/ 1.0 72.0))
(s431 (/ 1.0 72.0))
(s432 (/ 1.0 72.0))
(s433 (/ 1.0 8.0))
(s434 (/ 1.0 72.0))
(s435 (/ 1.0 72.0))
(s436 (/ 1.0 72.0))
(s439 (/ 1.0 72.0))
(s440 (/ 1.0 72.0))
(s441 (/ 1.0 72.0))
(s442 (/ 1.0 72.0))
(s443 (/ 1.0 72.0))
(s444 (/ 1.0 72.0))
(s445 (/ 35.0 36.0))
(s446 (/ 1.0 72.0))
(s447 (/ 1.0 72.0))
(s448 (/ 1.0 72.0))
(s449 (/ 1.0 72.0))
(s450 (/ 1.0 72.0))
(s451 (/ 1.0 72.0))
(s452 (/ 1.0 72.0))
(s453 (/ 1.0 72.0))
(s454 (/ 1.0 72.0))
(s455 (/ 31.0 72.0))
(s456 (/ 1.0 72.0))
(s457 (/ 1.0 72.0))
(s458 timeout
(/ org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 974/4333 variables, and 82 constraints, problems are : Problem set: 0 solved, 879 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 51/73 constraints, Generalized P Invariants (flows): 31/171 constraints, State Equation: 0/1820 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/879 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (OVERLAPS) 95/974 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 5 (OVERLAPS) 2/976 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/4333 variables, and 84 constraints, problems are : Problem set: 0 solved, 879 unsolved in 45030 ms.
Refiners :[Positive P Invariants (semi-flows): 53/73 constraints, Generalized P Invariants (flows): 31/171 constraints, State Equation: 0/1820 constraints, PredecessorRefiner: 0/879 constraints, Known Traps: 0/0 constraints]
After SMT, in 90528ms problems are : Problem set: 0 solved, 879 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 879 out of 1820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 2513/2513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1820 transition count 2451
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 1758 transition count 2451
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 124 place count 1758 transition count 2409
Deduced a syphon composed of 42 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 210 place count 1714 transition count 2409
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 1714 transition count 2407
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 214 place count 1712 transition count 2407
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 43 rules applied. Total rules applied 257 place count 1690 transition count 2386
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 258 place count 1690 transition count 2385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 259 place count 1689 transition count 2385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 259 place count 1689 transition count 2384
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 1688 transition count 2384
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 1687 transition count 2384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 264 place count 1686 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 265 place count 1685 transition count 2382
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 1685 transition count 2382
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 271 place count 1685 transition count 2377
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 14 rules applied. Total rules applied 285 place count 1677 transition count 2371
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 289 place count 1673 transition count 2371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 289 place count 1673 transition count 2370
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 291 place count 1672 transition count 2370
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 292 place count 1671 transition count 2370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 296 place count 1669 transition count 2368
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 297 place count 1668 transition count 2367
Iterating global reduction 10 with 1 rules applied. Total rules applied 298 place count 1668 transition count 2367
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 299 place count 1668 transition count 2366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 300 place count 1667 transition count 2366
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 305 place count 1667 transition count 2366
Applied a total of 305 rules in 319 ms. Remains 1667 /1820 variables (removed 153) and now considering 2366/2513 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 1667/1820 places, 2366/2513 transitions.
RANDOM walk for 2493477 steps (25499 resets) in 120004 ms. (20 steps per ms) remains 846/879 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 846/846 properties
Probabilistic random walk after 1000000 steps, saw 267941 distinct states, run finished after 34583 ms. (steps per millisecond=28 ) properties seen :33
// Phase 1: matrix 2366 rows 1667 cols
[2025-05-29 19:35:43] [INFO ] Computed 235 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (OVERLAPS) 55/868 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 5 (OVERLAPS) 2/870 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 870/4033 variables, and 77 constraints, problems are : Problem set: 0 solved, 813 unsolved in 75033 ms.
Refiners :[Positive P Invariants (semi-flows): 49/78 constraints, Generalized P Invariants (flows): 28/157 constraints, State Equation: 0/1667 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 813 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (OVERLAPS) 55/868 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 5 (OVERLAPS) 2/870 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/870 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 7 (OVERLAPS) 264/1134 variables, 51/128 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:37:42] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 61 ms to minimize.
[2025-05-29 19:37:42] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 5 ms to minimize.
[2025-05-29 19:37:42] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 5 ms to minimize.
[2025-05-29 19:37:42] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 3 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2025-05-29 19:37:44] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2025-05-29 19:37:46] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2025-05-29 19:37:48] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2025-05-29 19:37:49] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:37:52] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 6 ms to minimize.
[2025-05-29 19:37:52] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 2 ms to minimize.
[2025-05-29 19:37:52] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 2 ms to minimize.
[2025-05-29 19:37:53] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2025-05-29 19:37:53] [INFO ] Deduced a trap composed of 101 places in 190 ms of which 3 ms to minimize.
[2025-05-29 19:37:53] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 2 ms to minimize.
[2025-05-29 19:37:56] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 3 ms to minimize.
[2025-05-29 19:37:58] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:37:58] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 4 ms to minimize.
[2025-05-29 19:38:03] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2025-05-29 19:38:08] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 4 ms to minimize.
[2025-05-29 19:38:12] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/4033 variables, and 152 constraints, problems are : Problem set: 0 solved, 813 unsolved in 75021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/78 constraints, Generalized P Invariants (flows): 79/157 constraints, State Equation: 0/1667 constraints, PredecessorRefiner: 0/813 constraints, Known Traps: 24/24 constraints]
After SMT, in 150460ms problems are : Problem set: 0 solved, 813 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 813 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 2366/2366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1667 transition count 2345
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1646 transition count 2345
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 42 place count 1646 transition count 2330
Deduced a syphon composed of 15 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 1629 transition count 2330
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 1629 transition count 2329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 1628 transition count 2329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 1628 transition count 2328
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 79 place count 1626 transition count 2328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 1626 transition count 2327
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 1625 transition count 2327
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 88 place count 1621 transition count 2324
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 88 place count 1621 transition count 2321
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 1618 transition count 2321
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 1617 transition count 2321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 1616 transition count 2320
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 1615 transition count 2319
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 1615 transition count 2319
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 1615 transition count 2318
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 102 place count 1614 transition count 2317
Applied a total of 102 rules in 207 ms. Remains 1614 /1667 variables (removed 53) and now considering 2317/2366 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 1614/1667 places, 2317/2366 transitions.
RANDOM walk for 1964882 steps (20511 resets) in 120004 ms. (16 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 813/813 properties
Probabilistic random walk after 1000001 steps, saw 280523 distinct states, run finished after 37802 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 2317 rows 1614 cols
[2025-05-29 19:39:22] [INFO ] Computed 230 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (OVERLAPS) 54/867 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 5 (OVERLAPS) 2/869 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/869 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 7 (OVERLAPS) 256/1125 variables, 51/128 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 216.0))
(s1 (/ 1.0 216.0))
(s2 (/ 13.0 216.0))
(s3 (/ 1.0 216.0))
(s4 (/ 1.0 216.0))
(s5 (/ 1.0 216.0))
(s6 (/ 1.0 216.0))
(s7 (/ 1.0 216.0))
(s8 (/ 1.0 216.0))
(s9 (/ 1.0 216.0))
(s10 (/ 1.0 216.0))
(s11 (/ 85.0 108.0))
(s12 (/ 1.0 216.0))
(s13 (/ 1.0 216.0))
(s14 (/ 1.0 216.0))
(s15 (/ 1.0 216.0))
(s16 (/ 1.0 216.0))
(s17 (/ 1.0 216.0))
(s18 (/ 1.0 216.0))
(s19 (/ 1.0 216.0))
(s20 (/ 1.0 216.0))
(s21 (/ 1.0 216.0))
(s22 (/ 1.0 216.0))
(s23 (/ 1.0 216.0))
(s24 (/ 1.0 216.0))
(s25 (/ 1.0 216.0))
(s26 (/ 1.0 216.0))
(s27 (/ 1.0 216.0))
(s28 (/ 1.0 216.0))
(s29 (/ 1.0 216.0))
(s30 (/ 1.0 216.0))
(s31 (/ 1.0 216.0))
(s32 (/ 1.0 216.0))
(s33 (/ 1.0 216.0))
(s34 (/ 1.0 216.0))
(s35 0.0)
(s36 (/ 1.0 216.0))
(s37 (/ 1.0 216.0))
(s38 (/ 1.0 72.0))
(s39 (/ 17.0 18.0))
(s40 (/ 1.0 216.0))
(s41 (/ 1.0 36.0))
(s42 0.0)
(s43 0.0)
(s44 (/ 1.0 216.0))
(s45 (/ 1.0 216.0))
(s46 (/ 1.0 216.0))
(s47 (/ 1.0 216.0))
(s48 (/ 1.0 216.0))
(s49 (/ 1.0 216.0))
(s50 (/ 1.0 24.0))
(s51 (/ 1.0 216.0))
(s52 (/ 1.0 216.0))
(s53 (/ 1.0 216.0))
(s54 (/ 1.0 216.0))
(s55 (/ 1.0 216.0))
(s56 (/ 1.0 216.0))
(s57 (/ 1.0 216.0))
(s58 (/ 1.0 216.0))
(s59 (/ 23.0 27.0))
(s60 (/ 1.0 216.0))
(s61 (/ 1.0 216.0))
(s62 (/ 1.0 216.0))
(s63 (/ 1.0 216.0))
(s64 (/ 1.0 216.0))
(s65 (/ 1.0 216.0))
(s66 (/ 1.0 216.0))
(s67 (/ 1.0 216.0))
(s68 (/ 1.0 216.0))
(s69 (/ 1.0 216.0))
(s70 (/ 1.0 216.0))
(s71 (/ 179.0 216.0))
(s72 (/ 1.0 216.0))
(s73 (/ 1.0 216.0))
(s74 (/ 1.0 216.0))
(s75 (/ 1.0 216.0))
(s76 (/ 1.0 216.0))
(s77 (/ 1.0 216.0))
(s78 (/ 1.0 216.0))
(s79 (/ 1.0 216.0))
(s80 (/ 1.0 216.0))
(s81 (/ 1.0 216.0))
(s82 (/ 1.0 216.0))
(s83 (/ 1.0 216.0))
(s84 (/ 1.0 216.0))
(s85 (/ 1.0 216.0))
(s86 (/ 1.0 216.0))
(s87 (/ 1.0 216.0))
(s88 (/ 1.0 216.0))
(s89 (/ 1.0 216.0))
(s90 (/ 1.0 216.0))
(s91 (/ 1.0 216.0))
(s92 (/ 1.0 216.0))
(s93 (/ 1.0 216.0))
(s94 (/ 1.0 216.0))
(s95 (/ 1.0 216.0))
(s96 (/ 1.0 216.0))
(s97 (/ 1.0 216.0))
(s98 (/ 1.0 216.0))
(s99 (/ 1.0 216.0))
(s100 (/ 1.0 216.0))
(s101 (/ 1.0 216.0))
(s102 (/ 1.0 216.0))
(s103 (/ 1.0 216.0))
(s104 (/ 1.0 216.0))
(s105 (/ 1.0 216.0))
(s106 (/ 1.0 216.0))
(s107 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.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 (/ 91.0 108.0))
(s128 (/ 1.0 216.0))
(s129 (/ 1.0 216.0))
(s130 (/ 1.0 216.0))
(s131 (/ 1.0 216.0))
(s132 (/ 1.0 216.0))
(s133 (/ 1.0 216.0))
(s134 (/ 1.0 216.0))
(s135 (/ 1.0 216.0))
(s136 (/ 1.0 216.0))
(s137 (/ 1.0 216.0))
(s138 (/ 1.0 216.0))
(s139 (/ 1.0 216.0))
(s140 (/ 1.0 216.0))
(s141 (/ 1.0 216.0))
(s142 (/ 1.0 216.0))
(s143 (/ 1.0 216.0))
(s144 (/ 1.0 216.0))
(s145 (/ 1.0 216.0))
(s146 (/ 1.0 24.0))
(s147 (/ 1.0 216.0))
(s148 (/ 1.0 216.0))
(s149 (/ 1.0 216.0))
(s150 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/3931 variables, and 128 constraints, problems are : Problem set: 0 solved, 813 unsolved in 90023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/76 constraints, Generalized P Invariants (flows): 79/154 constraints, State Equation: 0/1614 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 813 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (OVERLAPS) 54/867 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 5 (OVERLAPS) 2/869 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/869 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 7 (OVERLAPS) 256/1125 variables, 51/128 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 4 ms to minimize.
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 2 ms to minimize.
[2025-05-29 19:41:41] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2025-05-29 19:41:41] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2025-05-29 19:41:42] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2025-05-29 19:41:42] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2025-05-29 19:41:43] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2025-05-29 19:41:43] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2025-05-29 19:41:43] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 4 ms to minimize.
[2025-05-29 19:41:45] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 2 ms to minimize.
[2025-05-29 19:41:46] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2025-05-29 19:41:51] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2025-05-29 19:41:51] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 2 ms to minimize.
[2025-05-29 19:41:52] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 3 ms to minimize.
[2025-05-29 19:41:53] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 4 ms to minimize.
[2025-05-29 19:41:55] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 4 ms to minimize.
[2025-05-29 19:41:56] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2025-05-29 19:41:56] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2025-05-29 19:41:57] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:42:03] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2025-05-29 19:42:04] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 1 ms to minimize.
[2025-05-29 19:42:08] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 4 ms to minimize.
[2025-05-29 19:42:16] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 4 ms to minimize.
[2025-05-29 19:42:16] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 5 ms to minimize.
[2025-05-29 19:42:19] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 4 ms to minimize.
[2025-05-29 19:42:19] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/3931 variables, and 155 constraints, problems are : Problem set: 0 solved, 813 unsolved in 90021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/76 constraints, Generalized P Invariants (flows): 79/154 constraints, State Equation: 0/1614 constraints, PredecessorRefiner: 0/813 constraints, Known Traps: 27/27 constraints]
After SMT, in 180307ms problems are : Problem set: 0 solved, 813 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 813 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 2317/2317 transitions.
Applied a total of 0 rules in 28 ms. Remains 1614 /1614 variables (removed 0) and now considering 2317/2317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1614/1614 places, 2317/2317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 2317/2317 transitions.
Applied a total of 0 rules in 27 ms. Remains 1614 /1614 variables (removed 0) and now considering 2317/2317 (removed 0) transitions.
[2025-05-29 19:42:22] [INFO ] Invariant cache hit.
[2025-05-29 19:42:22] [INFO ] Implicit Places using invariants in 605 ms returned [108, 312, 353, 518, 545, 586, 750, 777, 818, 982, 1009, 1032, 1190, 1214, 1215, 1217, 1234, 1252, 1271, 1321, 1322, 1333, 1334, 1336, 1353, 1371, 1440, 1444, 1445, 1448, 1459, 1460, 1461, 1479, 1481, 1485, 1503, 1504, 1505, 1506, 1518, 1524, 1530, 1536, 1542, 1548, 1554, 1560, 1566, 1572, 1578]
[2025-05-29 19:42:22] [INFO ] Actually due to overlaps returned [1479, 1461, 108, 353, 586, 818, 1032, 1234, 1353, 1485, 1217, 1336, 1215, 1333, 1459, 1503, 312, 545, 777, 1009, 1214, 1334, 1460, 1481, 1504, 518, 750, 982, 1190, 1321, 1322, 1444, 1445, 1371, 1505, 1548, 1566, 1578, 1252, 1271, 1448, 1506, 1518, 1524, 1530, 1536, 1542, 1554, 1560, 1572]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 615 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1564/1614 places, 2317/2317 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 1563 transition count 2226
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 184 place count 1472 transition count 2225
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 184 place count 1472 transition count 2207
Deduced a syphon composed of 18 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 221 place count 1453 transition count 2207
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 233 place count 1449 transition count 2199
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 241 place count 1441 transition count 2199
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 256 place count 1426 transition count 2184
Iterating global reduction 4 with 15 rules applied. Total rules applied 271 place count 1426 transition count 2184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 274 place count 1426 transition count 2181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 274 place count 1426 transition count 2180
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 1425 transition count 2180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 279 place count 1422 transition count 2174
Iterating global reduction 5 with 3 rules applied. Total rules applied 282 place count 1422 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 283 place count 1421 transition count 2173
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 1421 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 285 place count 1420 transition count 2171
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 1420 transition count 2171
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 5 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 372 place count 1377 transition count 2128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 373 place count 1377 transition count 2127
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 374 place count 1376 transition count 2126
Iterating global reduction 6 with 1 rules applied. Total rules applied 375 place count 1376 transition count 2126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 376 place count 1376 transition count 2125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 380 place count 1374 transition count 2126
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 398 place count 1374 transition count 2108
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 417 place count 1355 transition count 2108
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 431 place count 1355 transition count 2108
Applied a total of 431 rules in 249 ms. Remains 1355 /1564 variables (removed 209) and now considering 2108/2317 (removed 209) transitions.
// Phase 1: matrix 2108 rows 1355 cols
[2025-05-29 19:42:23] [INFO ] Computed 173 invariants in 24 ms
[2025-05-29 19:42:23] [INFO ] Implicit Places using invariants in 504 ms returned [235, 278, 279, 471, 499, 500, 686, 714, 715, 901, 929, 930, 1084, 1090, 1093, 1095, 1116, 1117, 1194, 1200, 1203, 1205, 1210, 1211, 1263, 1280, 1286, 1289, 1291]
[2025-05-29 19:42:23] [INFO ] Actually due to overlaps returned [278, 499, 714, 929, 1116, 1210, 715, 1117, 1211, 500, 930, 279, 1090, 1095, 1194, 1200, 1205, 1280, 1286, 1291, 235, 471, 686, 901, 1084, 1263]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 509 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1329/1614 places, 2108/2317 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1318 transition count 2097
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1318 transition count 2097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1316 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1316 transition count 2095
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1312 transition count 2091
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 43 place count 1312 transition count 2082
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 52 place count 1303 transition count 2082
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1303 transition count 2081
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1302 transition count 2081
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1302 transition count 2081
Applied a total of 55 rules in 171 ms. Remains 1302 /1329 variables (removed 27) and now considering 2081/2108 (removed 27) transitions.
// Phase 1: matrix 2081 rows 1302 cols
[2025-05-29 19:42:23] [INFO ] Computed 147 invariants in 22 ms
[2025-05-29 19:42:24] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-05-29 19:42:24] [INFO ] Invariant cache hit.
[2025-05-29 19:42:25] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1302/1614 places, 2081/2317 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3455 ms. Remains : 1302/1614 places, 2081/2317 transitions.
RANDOM walk for 1379977 steps (19517 resets) in 120004 ms. (11 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (9 resets) in 51 ms. (77 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (10 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (9 resets) in 39 ms. (100 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (9 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 813/813 properties
Probabilistic random walk after 1000001 steps, saw 177530 distinct states, run finished after 23674 ms. (steps per millisecond=42 ) properties seen :0
[2025-05-29 19:43:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (OVERLAPS) 26/839 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/839 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/839 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 5 (OVERLAPS) 259/1098 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 7 (OVERLAPS) 7/1105 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 9 (OVERLAPS) 114/1219 variables, 16/133 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1219/3383 variables, and 133 constraints, problems are : Problem set: 0 solved, 813 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/51 constraints, Generalized P Invariants (flows): 87/96 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 813 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (OVERLAPS) 26/839 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/839 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-05-29 19:45:19] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/839 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/839 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 6 (OVERLAPS) 259/1098 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:45:46] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2025-05-29 19:45:47] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 5 ms to minimize.
[2025-05-29 19:45:49] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:45:49] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:45:49] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2025-05-29 19:45:49] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2025-05-29 19:45:50] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 3 ms to minimize.
[2025-05-29 19:45:52] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2025-05-29 19:45:53] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2025-05-29 19:45:56] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2025-05-29 19:45:57] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 3 ms to minimize.
[2025-05-29 19:45:57] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 3 ms to minimize.
[2025-05-29 19:46:00] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 3 ms to minimize.
[2025-05-29 19:46:00] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2025-05-29 19:46:00] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2025-05-29 19:46:00] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2025-05-29 19:46:01] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2025-05-29 19:46:03] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 3 ms to minimize.
[2025-05-29 19:46:05] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 4 ms to minimize.
[2025-05-29 19:46:05] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1098 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2025-05-29 19:46:10] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 1 ms to minimize.
[2025-05-29 19:46:20] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 4 ms to minimize.
[2025-05-29 19:46:21] [INFO ] Deduced a trap composed of 74 places in 312 ms of which 4 ms to minimize.
[2025-05-29 19:46:22] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 6 ms to minimize.
[2025-05-29 19:46:24] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 4 ms to minimize.
[2025-05-29 19:46:27] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 4 ms to minimize.
[2025-05-29 19:46:28] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 4 ms to minimize.
[2025-05-29 19:46:29] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 5 ms to minimize.
[2025-05-29 19:46:29] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 4 ms to minimize.
[2025-05-29 19:46:35] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1098 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/3383 variables, and 146 constraints, problems are : Problem set: 0 solved, 813 unsolved in 105019 ms.
Refiners :[Positive P Invariants (semi-flows): 41/51 constraints, Generalized P Invariants (flows): 71/96 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 0/813 constraints, Known Traps: 34/34 constraints]
After SMT, in 210261ms problems are : Problem set: 0 solved, 813 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 813 out of 1302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1302/1302 places, 2081/2081 transitions.
Applied a total of 0 rules in 21 ms. Remains 1302 /1302 variables (removed 0) and now considering 2081/2081 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1302/1302 places, 2081/2081 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1302/1302 places, 2081/2081 transitions.
Applied a total of 0 rules in 20 ms. Remains 1302 /1302 variables (removed 0) and now considering 2081/2081 (removed 0) transitions.
[2025-05-29 19:46:50] [INFO ] Invariant cache hit.
[2025-05-29 19:46:50] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-05-29 19:46:50] [INFO ] Invariant cache hit.
[2025-05-29 19:46:52] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2025-05-29 19:46:52] [INFO ] Redundant transitions in 93 ms returned []
Running 2039 sub problems to find dead transitions.
[2025-05-29 19:46:52] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.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 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 0.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 0.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 1.0)
(s909 1.0)
(s910 0.0)
(s911 0.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 0.0)
(s916 1.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 1.0)
(s930 0.0)
(s931 1.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 0.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 0.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 0.0)
(s1018 0.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 0.0)
(s1082 0.0)
(s1083 1.0)
(s1084 1.0)
(s1085 0.0)
(s1086 0.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 0.0)
(s1091 1.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 1.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 0.0)
(s1108 1.0)
(s1109 0.0)
(s1110 1.0)
(s1111 0.0)
(s1112 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1301 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 2039 unsolved
SMT process timed out in 31216ms, After SMT, problems are : Problem set: 0 solved, 2039 unsolved
Search for dead transitions found 0 dead transitions in 31244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33384 ms. Remains : 1302/1302 places, 2081/2081 transitions.
RANDOM walk for 400000 steps (5658 resets) in 23671 ms. (16 steps per ms) remains 810/813 properties
Running SMT prover for 810 properties.
[2025-05-29 19:47:30] [INFO ] Invariant cache hit.
[2025-05-29 19:47:30] [INFO ] [Real]Absence check using 51 positive place invariants in 10 ms returned sat
[2025-05-29 19:47:30] [INFO ] [Real]Absence check using 51 positive and 96 generalized place invariants in 39 ms returned sat
[2025-05-29 19:47:34] [INFO ] After 3787ms SMT Verify possible using state equation in real domain returned unsat :0 sat :810
TRAPS : Iteration 0
[2025-05-29 19:49:02] [INFO ] After 91262ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:810
[2025-05-29 19:49:02] [INFO ] After 91920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:810
[2025-05-29 19:49:02] [INFO ] [Nat]Absence check using 51 positive place invariants in 9 ms returned sat
[2025-05-29 19:49:02] [INFO ] [Nat]Absence check using 51 positive and 96 generalized place invariants in 38 ms returned sat
[2025-05-29 19:52:22] [INFO ] After 199339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :806
TRAPS : Iteration 0
[2025-05-29 19:52:22] [INFO ] After 199341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :806
[2025-05-29 19:52:22] [INFO ] After 200025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :806
RANDOM walk for 2653387 steps (37803 resets) in 120004 ms. (22 steps per ms) remains 801/813 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (9 resets) in 45 ms. (87 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (9 resets) in 40 ms. (97 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (10 resets) in 46 ms. (85 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (9 resets) in 48 ms. (81 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (9 resets) in 43 ms. (91 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4001 steps (9 resets) in 34 ms. (114 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (9 resets) in 43 ms. (90 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (9 resets) in 47 ms. (83 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 801/801 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 801/801 properties
Probabilistic random walk after 1000001 steps, saw 177530 distinct states, run finished after 26287 ms. (steps per millisecond=38 ) properties seen :0
[2025-05-29 19:53:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/801 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (OVERLAPS) 26/827 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/827 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 5 (OVERLAPS) 271/1098 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 7 (OVERLAPS) 7/1105 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 9 (OVERLAPS) 114/1219 variables, 16/133 constraints. Problems are: Problem set: 0 solved, 801 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 1219/3383 variables, and 133 constraints, problems are : Problem set: 0 solved, 801 unsolved in 120025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/51 constraints, Generalized P Invariants (flows): 87/96 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/801 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (OVERLAPS) 26/827 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/827 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2025-05-29 19:55:29] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:55:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 6 (OVERLAPS) 271/1098 variables, 38/114 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2025-05-29 19:55:59] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 5 ms to minimize.
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 5 ms to minimize.
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 5 ms to minimize.
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 4 ms to minimize.
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 3 ms to minimize.
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 2 ms to minimize.
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2025-05-29 19:56:03] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-05-29 19:56:04] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2025-05-29 19:56:06] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2025-05-29 19:56:07] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2025-05-29 19:56:07] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2025-05-29 19:56:07] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-05-29 19:56:10] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2025-05-29 19:56:10] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:56:11] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 3 ms to minimize.
[2025-05-29 19:56:12] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2025-05-29 19:56:12] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2025-05-29 19:56:12] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 4 ms to minimize.
[2025-05-29 19:56:15] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1098 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2025-05-29 19:56:16] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 4 ms to minimize.
[2025-05-29 19:56:21] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2025-05-29 19:56:25] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 2 ms to minimize.
[2025-05-29 19:56:25] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 3 ms to minimize.
[2025-05-29 19:56:30] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2025-05-29 19:56:30] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2025-05-29 19:56:33] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 3 ms to minimize.
[2025-05-29 19:56:37] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2025-05-29 19:56:38] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2025-05-29 19:56:38] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2025-05-29 19:56:39] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2025-05-29 19:56:39] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2025-05-29 19:56:42] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1098 variables, 16/150 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2025-05-29 19:56:47] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2025-05-29 19:57:07] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 3 ms to minimize.
[2025-05-29 19:57:09] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 1 ms to minimize.
[2025-05-29 19:57:10] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1098 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/3383 variables, and 154 constraints, problems are : Problem set: 0 solved, 801 unsolved in 120024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/51 constraints, Generalized P Invariants (flows): 71/96 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 42/42 constraints]
After SMT, in 240255ms problems are : Problem set: 0 solved, 801 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 801 out of 1302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1302/1302 places, 2081/2081 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1302 transition count 2071
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1292 transition count 2071
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 1292 transition count 2070
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 1291 transition count 2070
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1290 transition count 2069
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1290 transition count 2069
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 1289 transition count 2068
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1289 transition count 2068
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 1289 transition count 2067
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 1288 transition count 2067
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 1288 transition count 2067
Applied a total of 29 rules in 98 ms. Remains 1288 /1302 variables (removed 14) and now considering 2067/2081 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1288/1302 places, 2067/2081 transitions.
RANDOM walk for 2759193 steps (38868 resets) in 120004 ms. (22 steps per ms) remains 798/801 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (9 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (9 resets) in 54 ms. (72 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (9 resets) in 49 ms. (80 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (9 resets) in 50 ms. (78 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (10 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (9 resets) in 52 ms. (75 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (9 resets) in 43 ms. (91 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (9 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (9 resets) in 38 ms. (102 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4003 steps (10 resets) in 36 ms. (108 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 798/798 properties
Probabilistic random walk after 1000001 steps, saw 177526 distinct states, run finished after 26678 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 2067 rows 1288 cols
[2025-05-29 19:58:17] [INFO ] Computed 147 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/798 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (OVERLAPS) 26/824 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/824 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 5 (OVERLAPS) 258/1082 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1082 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 7 (OVERLAPS) 7/1089 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 9 (OVERLAPS) 98/1187 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1187 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 11 (OVERLAPS) 20/1207 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1207/3355 variables, and 136 constraints, problems are : Problem set: 0 solved, 798 unsolved in 135020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/52 constraints, Generalized P Invariants (flows): 87/95 constraints, State Equation: 0/1288 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/798 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (OVERLAPS) 26/824 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/824 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2025-05-29 20:00:42] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-29 20:00:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2025-05-29 20:00:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 7 (OVERLAPS) 258/1082 variables, 40/117 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2025-05-29 20:01:24] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 5 ms to minimize.
[2025-05-29 20:01:24] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2025-05-29 20:01:24] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2025-05-29 20:01:25] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 75 places in 228 ms of which 3 ms to minimize.
[2025-05-29 20:01:33] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2025-05-29 20:01:35] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2025-05-29 20:01:36] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 3 ms to minimize.
[2025-05-29 20:01:36] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 3 ms to minimize.
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2025-05-29 20:01:39] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 111 places in 204 ms of which 3 ms to minimize.
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2025-05-29 20:01:47] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 3 ms to minimize.
[2025-05-29 20:01:47] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2025-05-29 20:01:49] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2025-05-29 20:01:51] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 2 ms to minimize.
[2025-05-29 20:01:51] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2025-05-29 20:01:52] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 4 ms to minimize.
[2025-05-29 20:01:52] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 4 ms to minimize.
[2025-05-29 20:01:58] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 3 ms to minimize.
[2025-05-29 20:01:58] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 4 ms to minimize.
[2025-05-29 20:01:59] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 4 ms to minimize.
[2025-05-29 20:01:59] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 3 ms to minimize.
[2025-05-29 20:02:01] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 4 ms to minimize.
[2025-05-29 20:02:02] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 4 ms to minimize.
[2025-05-29 20:02:05] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 4 ms to minimize.
[2025-05-29 20:02:06] [INFO ] Deduced a trap composed of 54 places in 319 ms of which 5 ms to minimize.
[2025-05-29 20:02:09] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2025-05-29 20:02:09] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2025-05-29 20:02:11] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 1 ms to minimize.
[2025-05-29 20:02:12] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 19/156 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2025-05-29 20:02:19] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-07b"
export BK_EXAMINATION="StableMarking"
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 ASLink-PT-07b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r014-tall-174853743600243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07b.tgz
mv ASLink-PT-07b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;