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-174853743500193.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-02b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743500193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 417K 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 1748544808088

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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:53:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:53:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:53:29] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-05-29 18:53:29] [INFO ] Transformed 1242 places.
[2025-05-29 18:53:29] [INFO ] Transformed 1621 transitions.
[2025-05-29 18:53:29] [INFO ] Found NUPN structural information;
[2025-05-29 18:53:29] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 256 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 13 ms.
RANDOM walk for 40000 steps (168 resets) in 3202 ms. (12 steps per ms) remains 156/1096 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 156/156 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 156/156 properties
// Phase 1: matrix 1621 rows 1242 cols
[2025-05-29 18:53:30] [INFO ] Computed 121 invariants in 88 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 120/276 variables, 13/173 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 120/293 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 163/439 variables, 14/308 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 163/471 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 788/1227 variables, 84/555 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 788/1343 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 2.0 45.0))
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 (/ 43.0 45.0))
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 (/ 41.0 45.0))
(s45 0.0)
(s46 0.0)
(s47 (/ 1.0 90.0))
(s48 (/ 1.0 15.0))
(s49 (/ 1.0 90.0))
(s50 0.0)
(s51 0.0)
(s52 (/ 34.0 45.0))
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 (/ 1.0 90.0))
(s58 (/ 1.0 90.0))
(s59 (/ 1.0 10.0))
(s60 (/ 1.0 90.0))
(s61 (/ 1.0 90.0))
(s62 (/ 1.0 90.0))
(s63 (/ 1.0 90.0))
(s64 (/ 1.0 90.0))
(s65 (/ 1.0 90.0))
(s66 (/ 1.0 90.0))
(s67 (/ 1.0 90.0))
(s68 (/ 1.0 90.0))
(s69 (/ 1.0 90.0))
(s70 (/ 1.0 90.0))
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 (/ 71.0 90.0))
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 (/ 19.0 90.0))
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 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 0.0)
(s128 (/ 1.0 6.0))
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 (/ 2.0 45.0))
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 (/ 19.0 90.0))
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 90.0))
(s185 (/ 1.0 90.0))
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 1.0 90.0))
(s202 (/ 1.0 90.0))
(s203 (/ 1.0 90.0))
(s204 (/ 1.0 90.0))
(s205 (/ 1.0 90.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 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 (/ 71.0 90.0))
(s231 0.0)
(s232 0.0)
(s233 (/ 1.0 90.0))
(s234 (/ 1.0 90.0))
(s235 (/ 1.0 90.0))
(s236 (/ 1.0 90.0))
(s237 (/ 1.0 90.0))
(s238 (/ 1.0 90.0))
(s239 (/ 1.0 90.0))
(s240 (/ 1.0 90.0))
(s241 (/ 1.0 90.0))
(s242 (/ 1.0 90.0))
(s243 (/ 1.0 90.0))
(s244 (/ 1.0 90.0))
(s245 (/ 1.0 90.0))
(s246 (/ 1.0 90.0))
(s247 (/ 1.0 90.0))
(s248 (/ 1.0 90.0))
(s249 (/ 1.0 90.0))
(s250 (/ 1.0 90.0))
(s251 (/ 1.0 90.0))
(s252 (/ 1.0 90.0))
(s253 (/ 1.0 90.0))
(s254 (/ 1.0 90.0))
(s255 (/ 1.0 90.0))
(s256 (/ 1.0 90.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 90.0))
(s259 (/ 1.0 90.0))
(s260 (/ 1.0 90.0))
(s261 (/ 1.0 90.0))
(s262 (/ 1.0 90.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 90.0))
(s265 (/ 1.0 90.0))
(s266 (/ 1.0 90.0))
(s267 (/ 23.0 45.0))
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 (/ 1.0 90.0))
(s274 (/ 1.0 90.0))
(s275 (/ 1.0 90.0))
(s276 (/ 1.0 90.0))
(s277 (/ 1.0 90.0))
(s278 (/ 1.0 90.0))
(s279 (/ 1.0 90.0))
(s280 (/ 1.0 90.0))
(s281 (/ 1.0 90.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 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 (/ 1.0 10.0))
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 (/ 1.0 90.0))
(s317 (/ 1.0 90.0))
(s318 (/ 1.0 90.0))
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 (/ 1.0 30.0))
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 (/ 8.0 9.0))
(s413 (/ 1.0 90.0))
(s414 (/ 1.0 90.0))
(s415 (/ 1.0 90.0))
(s416 (/ 2.0 45.0))
(s417 (/ 1.0 90.0))
(s418 (/ 1.0 90.0))
(s419 (/ 1.0 90.0))
(s420 (/ 1.0 90.0))
(s421 (/ 1.0 90.0))
(s422 (/ 1.0 90.0))
(s423 (/ 2.0 45.0))
(s424 0.0)
(s425 (/ 1.0 90.0))
(s426 (/ 1.0 90.0))
(s427 (/ 1.0 90.0))
(s428 (/ 1.0 90.0))
(s429 (/ 1.0 90.0))
(s430 (/ 1.0 90.0))
(s431 (/ 13.0 90.0))
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 (/ 71.0 90.0))
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 (/ 29.0 30.0))
(s444 (/ 1.0 90.0))
(s445 (/ 1.0 90.0))
(s446 (/ 1.0 90.0))
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 (/ 1.0 90.0))
(s457 (/ 1.0 90.0))
(s458 (/ 1.0 90.0))
(s459 (/ 29.0 30.0))
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 (/ 32.0 45.0))
(s470 0.0)
(s471 0.0)
(s472 (/ 13.0 45.0))
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 (/ 7.0 90.0))
(s484 0.0)
(s485 (/ 17.0 90.0))
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.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 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 (/ 11.0 15.0))
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 (/ 43.0 45.0))
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 (/ 2.0 45.0))
(s550 (/ 89.0 90.0))
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 (/ 1.0 90.0))
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 (/ 1.0 90.0))
(s594 (/ 1.0 90.0))
(s595 (/ 1.0 90.0))
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 (/ 71.0 90.0))
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.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 (/ 71.0 90.0))
(s655 0.0)
(s656 0.0)
(s657 (/ 71.0 90.0))
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 (/ 71.0 90.0))
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 (/ 1.0 90.0))
(s669 (/ 1.0 90.0))
(s670 (/ 1.0 90.0))
(s671 (/ 1.0 90.0))
(s672 (/ 1.0 90.0))
(s673 (/ 1.0 90.0))
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 (/ 1.0 15.0))
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 (/ 1.0 90.0))
(s712 (/ 1.0 90.0))
(s713 (/ 1.0 90.0))
(s714 (/ 1.0 90.0))
(s715 (/ 1.0 90.0))
(s716 (/ 1.0 90.0))
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 (/ 1.0 15.0))
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 (/ 1.0 90.0))
(s798 (/ 1.0 90.0))
(s799 (/ 1.0 90.0))
(s800 (/ 1.0 90.0))
(s801 (/ 1.0 90.0))
(s802 (/ 1.0 90.0))
(s803 0.0)
(s804 (/ 1.0 90.0))
(s805 (/ 1.0 90.0))
(s806 (/ 44.0 45.0))
(s807 0.0)
(s808 0.0)
(s809 (/ 1.0 45.0))
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 0.0)
(s848 (/ 1.0 90.0))
(s849 (/ 1.0 90.0))
(s850 (/ 1.0 90.0))
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 (/ 29.0 30.0))
(s859 (/ 7.0 90.0))
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 (/ 83.0 90.0))
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 (/ 11.0 15.0))
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 (/ 4.0 15.0))
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 timeout
0.0)
(s913 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/2863 variables, and 1343 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5048 ms.
Refiners :[Domain max(s): 1227/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 89/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 120/276 variables, 13/173 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 120/293 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 163/439 variables, 14/308 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 163/471 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 788/1227 variables, 84/555 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 788/1343 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2025-05-29 18:53:40] [INFO ] Deduced a trap composed of 64 places in 549 ms of which 74 ms to minimize.
[2025-05-29 18:53:41] [INFO ] Deduced a trap composed of 95 places in 412 ms of which 7 ms to minimize.
[2025-05-29 18:53:41] [INFO ] Deduced a trap composed of 228 places in 381 ms of which 6 ms to minimize.
SMT process timed out in 10577ms, After SMT, problems are : Problem set: 0 solved, 156 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 156 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1242 transition count 1378
Reduce places removed 243 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 257 rules applied. Total rules applied 500 place count 999 transition count 1364
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 504 place count 995 transition count 1364
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 504 place count 995 transition count 1115
Deduced a syphon composed of 249 places in 5 ms
Ensure Unique test removed 19 places
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 517 rules applied. Total rules applied 1021 place count 727 transition count 1115
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 14 rules applied. Total rules applied 1035 place count 726 transition count 1102
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1048 place count 713 transition count 1102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1048 place count 713 transition count 1095
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1069 place count 699 transition count 1095
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1069 place count 699 transition count 1088
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1083 place count 692 transition count 1088
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 1115 place count 660 transition count 1056
Iterating global reduction 5 with 32 rules applied. Total rules applied 1147 place count 660 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1148 place count 660 transition count 1055
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 1148 place count 660 transition count 1045
Deduced a syphon composed of 10 places in 4 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 1169 place count 649 transition count 1045
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1169 place count 649 transition count 1044
Deduced a syphon composed of 1 places in 4 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 1172 place count 647 transition count 1044
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1175 place count 644 transition count 1023
Iterating global reduction 6 with 3 rules applied. Total rules applied 1178 place count 644 transition count 1023
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1179 place count 643 transition count 1015
Iterating global reduction 6 with 1 rules applied. Total rules applied 1180 place count 643 transition count 1015
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1181 place count 642 transition count 1007
Iterating global reduction 6 with 1 rules applied. Total rules applied 1182 place count 642 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1183 place count 641 transition count 999
Iterating global reduction 6 with 1 rules applied. Total rules applied 1184 place count 641 transition count 999
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1185 place count 640 transition count 991
Iterating global reduction 6 with 1 rules applied. Total rules applied 1186 place count 640 transition count 991
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1187 place count 639 transition count 983
Iterating global reduction 6 with 1 rules applied. Total rules applied 1188 place count 639 transition count 983
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1189 place count 638 transition count 975
Iterating global reduction 6 with 1 rules applied. Total rules applied 1190 place count 638 transition count 975
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1191 place count 637 transition count 967
Iterating global reduction 6 with 1 rules applied. Total rules applied 1192 place count 637 transition count 967
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1193 place count 636 transition count 959
Iterating global reduction 6 with 1 rules applied. Total rules applied 1194 place count 636 transition count 959
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1195 place count 635 transition count 951
Iterating global reduction 6 with 1 rules applied. Total rules applied 1196 place count 635 transition count 951
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1197 place count 634 transition count 943
Iterating global reduction 6 with 1 rules applied. Total rules applied 1198 place count 634 transition count 943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1199 place count 633 transition count 935
Iterating global reduction 6 with 1 rules applied. Total rules applied 1200 place count 633 transition count 935
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1201 place count 632 transition count 927
Iterating global reduction 6 with 1 rules applied. Total rules applied 1202 place count 632 transition count 927
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1203 place count 631 transition count 919
Iterating global reduction 6 with 1 rules applied. Total rules applied 1204 place count 631 transition count 919
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1205 place count 630 transition count 911
Iterating global reduction 6 with 1 rules applied. Total rules applied 1206 place count 630 transition count 911
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1207 place count 629 transition count 903
Iterating global reduction 6 with 1 rules applied. Total rules applied 1208 place count 629 transition count 903
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1209 place count 628 transition count 895
Iterating global reduction 6 with 1 rules applied. Total rules applied 1210 place count 628 transition count 895
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 1332 place count 567 transition count 834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1333 place count 566 transition count 833
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1335 place count 565 transition count 833
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1336 place count 564 transition count 832
Iterating global reduction 6 with 1 rules applied. Total rules applied 1337 place count 564 transition count 832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1339 place count 564 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1340 place count 563 transition count 830
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1342 place count 562 transition count 839
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1346 place count 562 transition count 835
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1350 place count 558 transition count 835
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1351 place count 558 transition count 835
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1352 place count 558 transition count 835
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1353 place count 557 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1354 place count 556 transition count 834
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1354 place count 556 transition count 833
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1356 place count 555 transition count 833
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1357 place count 554 transition count 833
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1359 place count 553 transition count 832
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1360 place count 552 transition count 831
Iterating global reduction 11 with 1 rules applied. Total rules applied 1361 place count 552 transition count 831
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1362 place count 552 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1363 place count 551 transition count 830
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1364 place count 551 transition count 830
Applied a total of 1364 rules in 716 ms. Remains 551 /1242 variables (removed 691) and now considering 830/1621 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 551/1242 places, 830/1621 transitions.
RANDOM walk for 4000000 steps (66677 resets) in 31599 ms. (126 steps per ms) remains 79/156 properties
BEST_FIRST walk for 400002 steps (2196 resets) in 1413 ms. (282 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2187 resets) in 1533 ms. (260 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2271 resets) in 1504 ms. (265 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1413 ms. (282 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2212 resets) in 1501 ms. (266 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2202 resets) in 1517 ms. (263 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2179 resets) in 1413 ms. (282 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2180 resets) in 1431 ms. (279 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2175 resets) in 1421 ms. (281 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2183 resets) in 1376 ms. (290 steps per ms) remains 71/79 properties
BEST_FIRST walk for 400002 steps (2213 resets) in 1343 ms. (297 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2205 resets) in 1319 ms. (303 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2236 resets) in 1387 ms. (288 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2217 resets) in 1765 ms. (226 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2212 resets) in 1311 ms. (304 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2182 resets) in 1450 ms. (275 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2182 resets) in 1111 ms. (359 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2228 resets) in 1089 ms. (366 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2243 resets) in 1089 ms. (366 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2228 resets) in 1086 ms. (367 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 1093 ms. (365 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2211 resets) in 1094 ms. (365 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2251 resets) in 1066 ms. (374 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2233 resets) in 1331 ms. (300 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2245 resets) in 1337 ms. (298 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2225 resets) in 1972 ms. (202 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2264 resets) in 1389 ms. (287 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2222 resets) in 1366 ms. (292 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2225 resets) in 1325 ms. (301 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2255 resets) in 1306 ms. (306 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2190 resets) in 1387 ms. (288 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2212 resets) in 1375 ms. (290 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2209 resets) in 1415 ms. (282 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2221 resets) in 1298 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2228 resets) in 1376 ms. (290 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2216 resets) in 1083 ms. (369 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400000 steps (2208 resets) in 1090 ms. (366 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2211 resets) in 1063 ms. (375 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2239 resets) in 1082 ms. (369 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2223 resets) in 1037 ms. (385 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2179 resets) in 1081 ms. (369 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2231 resets) in 1098 ms. (363 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2236 resets) in 1071 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2206 resets) in 1090 ms. (366 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2213 resets) in 1094 ms. (365 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2232 resets) in 1067 ms. (374 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2194 resets) in 1076 ms. (371 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400000 steps (2231 resets) in 1102 ms. (362 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2172 resets) in 1070 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2203 resets) in 1065 ms. (375 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2218 resets) in 1051 ms. (380 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2192 resets) in 1059 ms. (377 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2196 resets) in 1077 ms. (371 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2229 resets) in 1070 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2230 resets) in 1082 ms. (369 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2207 resets) in 1040 ms. (384 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2216 resets) in 1068 ms. (374 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1071 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2194 resets) in 1060 ms. (377 steps per ms) remains 71/71 properties
// Phase 1: matrix 830 rows 551 cols
[2025-05-29 18:54:13] [INFO ] Computed 89 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 9/80 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 1/81 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 125/206 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 58/264 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/265 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 163/428 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 54/482 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 4/486 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/486 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 18 (OVERLAPS) 65/551 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 20 (OVERLAPS) 830/1381 variables, 551/640 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1381 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 22 (OVERLAPS) 0/1381 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1381/1381 variables, and 640 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7108 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 9/80 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 1/81 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 125/206 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 58/264 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/265 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 163/428 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2025-05-29 18:54:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2025-05-29 18:54:23] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2025-05-29 18:54:24] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 54/482 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 18 (OVERLAPS) 4/486 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/486 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 20 (OVERLAPS) 65/551 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 22 (OVERLAPS) 830/1381 variables, 551/643 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1381 variables, 71/714 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1381 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 25 (OVERLAPS) 0/1381 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1381/1381 variables, and 714 constraints, problems are : Problem set: 0 solved, 71 unsolved in 14695 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints]
After SMT, in 21864ms problems are : Problem set: 0 solved, 71 unsolved
Fused 71 Parikh solutions to 65 different solutions.
Parikh walk visited 0 properties in 9398 ms.
Support contains 71 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 830/830 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 551 transition count 807
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 528 transition count 807
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 46 place count 528 transition count 789
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 84 place count 508 transition count 789
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 86 place count 508 transition count 787
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 506 transition count 787
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 104 place count 497 transition count 780
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 104 place count 497 transition count 777
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 494 transition count 777
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 112 place count 492 transition count 777
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 120 place count 488 transition count 773
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 122 place count 486 transition count 771
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 486 transition count 771
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 485 transition count 770
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 485 transition count 770
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 485 transition count 769
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 485 transition count 767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 131 place count 483 transition count 767
Applied a total of 131 rules in 98 ms. Remains 483 /551 variables (removed 68) and now considering 767/830 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 483/551 places, 767/830 transitions.
RANDOM walk for 4000000 steps (64858 resets) in 34537 ms. (115 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2237 resets) in 1047 ms. (381 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2197 resets) in 1051 ms. (380 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2231 resets) in 1026 ms. (389 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2197 resets) in 1057 ms. (378 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2253 resets) in 1956 ms. (204 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2197 resets) in 2005 ms. (199 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2186 resets) in 1183 ms. (337 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2212 resets) in 1061 ms. (376 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2285 resets) in 1033 ms. (386 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2242 resets) in 1028 ms. (388 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2246 resets) in 1024 ms. (390 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2214 resets) in 1032 ms. (387 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2244 resets) in 1038 ms. (384 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2251 resets) in 1039 ms. (384 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2212 resets) in 1013 ms. (394 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2237 resets) in 1032 ms. (387 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2206 resets) in 1043 ms. (383 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1046 ms. (382 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2255 resets) in 1030 ms. (387 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2234 resets) in 1074 ms. (372 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2207 resets) in 1049 ms. (380 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2237 resets) in 1029 ms. (388 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2216 resets) in 1041 ms. (383 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2238 resets) in 1041 ms. (383 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2249 resets) in 1036 ms. (385 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2202 resets) in 1048 ms. (381 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2198 resets) in 1045 ms. (382 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2283 resets) in 1034 ms. (386 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2231 resets) in 1040 ms. (384 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2169 resets) in 1037 ms. (385 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2252 resets) in 1053 ms. (379 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2264 resets) in 1044 ms. (382 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2272 resets) in 1058 ms. (377 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2222 resets) in 1069 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2213 resets) in 1074 ms. (372 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2253 resets) in 1044 ms. (382 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2217 resets) in 1080 ms. (370 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2178 resets) in 1101 ms. (362 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2239 resets) in 1072 ms. (372 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2206 resets) in 1081 ms. (369 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2252 resets) in 1058 ms. (377 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2222 resets) in 1059 ms. (377 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2242 resets) in 1041 ms. (383 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2204 resets) in 1054 ms. (379 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2209 resets) in 1054 ms. (379 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2229 resets) in 1042 ms. (383 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2215 resets) in 1056 ms. (378 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2240 resets) in 1067 ms. (374 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2236 resets) in 1069 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2239 resets) in 1076 ms. (371 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 14714840 steps, run timeout after 75001 ms. (steps per millisecond=196 ) properties seen :69 out of 71
Probabilistic random walk after 14714840 steps, saw 3183447 distinct states, run finished after 75019 ms. (steps per millisecond=196 ) properties seen :69
// Phase 1: matrix 767 rows 483 cols
[2025-05-29 18:56:25] [INFO ] Computed 83 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 112/201 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 122/368 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/368 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 59/427 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 54/481 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/481 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/482 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 767/1250 variables, 483/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1250 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1250 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1250/1250 variables, and 566 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 112/201 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 122/368 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/368 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 59/427 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 54/481 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/481 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/482 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 767/1250 variables, 483/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1250 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1250 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1250 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1250/1250 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 767/767 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 483 transition count 751
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 467 transition count 751
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 32 place count 467 transition count 734
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 68 place count 448 transition count 734
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 70 place count 447 transition count 733
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 446 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 71 place count 446 transition count 732
Deduced a syphon composed of 1 places in 1 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 74 place count 444 transition count 732
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 444 transition count 731
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 443 transition count 731
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 93 place count 434 transition count 723
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 93 place count 434 transition count 721
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 431 transition count 721
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 430 transition count 721
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 99 place count 430 transition count 720
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 429 transition count 720
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 105 place count 427 transition count 718
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 427 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 426 transition count 717
Applied a total of 107 rules in 59 ms. Remains 426 /483 variables (removed 57) and now considering 717/767 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 426/483 places, 717/767 transitions.
RANDOM walk for 4000000 steps (64950 resets) in 8471 ms. (472 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22311 resets) in 5065 ms. (789 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22373 resets) in 4357 ms. (917 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2800910 steps, run timeout after 15001 ms. (steps per millisecond=186 ) properties seen :0 out of 2
Probabilistic random walk after 2800910 steps, saw 722466 distinct states, run finished after 15001 ms. (steps per millisecond=186 ) properties seen :0
// Phase 1: matrix 717 rows 426 cols
[2025-05-29 18:56:47] [INFO ] Computed 76 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 86/148 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/187 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/189 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 122/311 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/357 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/424 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/425 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/426 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/426 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 717/1143 variables, 426/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1143 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1143 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 86/148 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/187 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/189 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 122/311 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/357 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/424 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/425 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/426 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/426 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 717/1143 variables, 426/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1143 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1143 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1143 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 456 ms.
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 717/717 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 426/426 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 717/717 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2025-05-29 18:56:49] [INFO ] Invariant cache hit.
[2025-05-29 18:56:49] [INFO ] Implicit Places using invariants in 376 ms returned [1, 18, 19, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 207, 256, 257, 260, 271, 272, 273, 291, 293, 297, 315, 316, 317, 318, 330, 336, 342, 348, 354, 360, 366, 372, 378, 384, 390]
[2025-05-29 18:56:49] [INFO ] Actually due to overlaps returned [291, 273, 49, 169, 297, 32, 152, 149, 271, 315, 150, 272, 293, 316, 1, 19, 256, 257, 67, 317, 360, 378, 390, 18, 187, 207, 260, 318, 330, 336, 342, 348, 354, 366, 372, 384]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 384 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 390/426 places, 717/717 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 389 transition count 657
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 329 transition count 656
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 122 place count 329 transition count 641
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 153 place count 313 transition count 641
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 165 place count 309 transition count 633
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 173 place count 301 transition count 633
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 188 place count 286 transition count 618
Iterating global reduction 4 with 15 rules applied. Total rules applied 203 place count 286 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 206 place count 286 transition count 615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 206 place count 286 transition count 614
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 285 transition count 614
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 211 place count 282 transition count 608
Iterating global reduction 5 with 3 rules applied. Total rules applied 214 place count 282 transition count 608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 215 place count 281 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 281 transition count 607
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 217 place count 280 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 280 transition count 605
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 264 place count 257 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 265 place count 257 transition count 581
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 256 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 256 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 268 place count 256 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 272 place count 254 transition count 580
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 277 place count 254 transition count 575
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 283 place count 248 transition count 575
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 289 place count 248 transition count 575
Applied a total of 289 rules in 77 ms. Remains 248 /390 variables (removed 142) and now considering 575/717 (removed 142) transitions.
// Phase 1: matrix 575 rows 248 cols
[2025-05-29 18:56:49] [INFO ] Computed 33 invariants in 3 ms
[2025-05-29 18:56:49] [INFO ] Implicit Places using invariants in 162 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 173, 179, 182, 184]
[2025-05-29 18:56:49] [INFO ] Actually due to overlaps returned [106, 107, 91, 97, 102, 173, 179, 184, 74, 103]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 165 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/426 places, 575/717 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 230 transition count 567
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 230 transition count 567
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 228 transition count 565
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 228 transition count 565
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 225 transition count 562
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 225 transition count 556
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 219 transition count 556
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 219 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 218 transition count 555
Applied a total of 40 rules in 43 ms. Remains 218 /238 variables (removed 20) and now considering 555/575 (removed 20) transitions.
// Phase 1: matrix 555 rows 218 cols
[2025-05-29 18:56:49] [INFO ] Computed 23 invariants in 7 ms
[2025-05-29 18:56:49] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-05-29 18:56:49] [INFO ] Invariant cache hit.
[2025-05-29 18:56:50] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/426 places, 555/717 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1178 ms. Remains : 218/426 places, 555/717 transitions.
RANDOM walk for 4000000 steps (101125 resets) in 7258 ms. (551 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (38529 resets) in 3432 ms. (1165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38489 resets) in 3319 ms. (1204 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 825718 steps, run visited all 2 properties in 4397 ms. (steps per millisecond=187 )
Probabilistic random walk after 825718 steps, saw 296028 distinct states, run finished after 4400 ms. (steps per millisecond=187 ) properties seen :2
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 209822 ms.
ITS solved all properties within timeout

BK_STOP 1748545019118

--------------------
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-02b"
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-02b, 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-174853743500193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;