About the Execution of ITS-Tools for ShieldIIPt-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ???????????????F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532900530.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 itstools
Input is ShieldIIPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532900530
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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.7K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 338K 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2023-15
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-00
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-01
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-02
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-03
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-04
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-05
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-06
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-07
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-08
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-09
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-10
FORMULA_NAME ShieldIIPt-PT-020B-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749136489796
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 15:14:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:14:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:14:51] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-05 15:14:51] [INFO ] Transformed 1403 places.
[2025-06-05 15:14:51] [INFO ] Transformed 1303 transitions.
[2025-06-05 15:14:51] [INFO ] Found NUPN structural information;
[2025-06-05 15:14:51] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 146 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 195 place count 1208 transition count 1108
Iterating global reduction 0 with 195 rules applied. Total rules applied 390 place count 1208 transition count 1108
Applied a total of 390 rules in 277 ms. Remains 1208 /1403 variables (removed 195) and now considering 1108/1303 (removed 195) transitions.
// Phase 1: matrix 1108 rows 1208 cols
[2025-06-05 15:14:51] [INFO ] Computed 181 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:14:52] [INFO ] Implicit Places using invariants in 542 ms returned []
[2025-06-05 15:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:14:53] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 1107 sub problems to find dead transitions.
[2025-06-05 15:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s743 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1207/2316 variables, and 0 constraints, problems are : Problem set: 0 solved, 1107 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1208 constraints, PredecessorRefiner: 1107/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)timeout
(s16 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/2316 variables, and 0 constraints, problems are : Problem set: 0 solved, 1107 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1208 constraints, PredecessorRefiner: 0/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 1107 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Starting structural reductions in LTL mode, iteration 1 : 1208/1403 places, 1108/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62021 ms. Remains : 1208/1403 places, 1108/1303 transitions.
Support contains 146 out of 1208 places after structural reductions.
[2025-06-05 15:15:53] [INFO ] Flatten gal took : 90 ms
[2025-06-05 15:15:53] [INFO ] Flatten gal took : 53 ms
[2025-06-05 15:15:53] [INFO ] Input system was already deterministic with 1108 transitions.
Support contains 144 out of 1208 places (down from 146) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1792 ms. (22 steps per ms) remains 29/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
[2025-06-05 15:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 818/870 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 338/1208 variables, 56/181 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1208 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1108/2316 variables, 1208/1389 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2316 variables, 0/1389 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/2316 variables, 0/1389 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2316/2316 variables, and 1389 constraints, problems are : Problem set: 1 solved, 28 unsolved in 3117 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1208/1208 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 821/870 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:57] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:58] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:59] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:59] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:59] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:59] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 15/140 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:59] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/870 variables, 1/141 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:00] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/870 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 338/1208 variables, 56/198 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:01] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:02] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:02] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:02] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:02] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:02] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/2316 variables, and 207 constraints, problems are : Problem set: 1 solved, 28 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1208 constraints, PredecessorRefiner: 0/29 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8139ms problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 1208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 1208 transition count 889
Reduce places removed 219 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 226 rules applied. Total rules applied 445 place count 989 transition count 882
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 452 place count 982 transition count 882
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 142 Pre rules applied. Total rules applied 452 place count 982 transition count 740
Deduced a syphon composed of 142 places in 4 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 284 rules applied. Total rules applied 736 place count 840 transition count 740
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 748 place count 828 transition count 728
Iterating global reduction 3 with 12 rules applied. Total rules applied 760 place count 828 transition count 728
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 760 place count 828 transition count 719
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 778 place count 819 transition count 719
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1422 place count 497 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1423 place count 497 transition count 396
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 4 with 2 rules applied. Total rules applied 1425 place count 496 transition count 395
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1525 place count 446 transition count 420
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1526 place count 446 transition count 419
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1528 place count 446 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1530 place count 444 transition count 417
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 1549 place count 444 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1550 place count 443 transition count 416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1552 place count 441 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1552 place count 441 transition count 415
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1554 place count 440 transition count 415
Applied a total of 1554 rules in 244 ms. Remains 440 /1208 variables (removed 768) and now considering 415/1108 (removed 693) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 440/1208 places, 415/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 523 ms. (76 steps per ms) remains 10/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
// Phase 1: matrix 415 rows 440 cols
[2025-06-05 15:16:03] [INFO ] Computed 179 invariants in 3 ms
[2025-06-05 15:16:03] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/308 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:03] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 22/330 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 311/641 variables, 330/463 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 83/546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 25/666 variables, 13/559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 36/702 variables, 16/581 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/702 variables, 6/587 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/702 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/703 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/703 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/703 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 39/742 variables, 16/606 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/742 variables, 7/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/742 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 3/745 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/745 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/745 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 43/788 variables, 24/639 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/788 variables, 9/648 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/788 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 2/790 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:06] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:06] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/790 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/790 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 34/824 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/824 variables, 5/677 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/824 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 2/826 variables, 4/681 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/826 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/826 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 15/841 variables, 8/691 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/841 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 39 (INCLUDED_ONLY) 0/841 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 1/842 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/842 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/842 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (OVERLAPS) 9/851 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/851 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/851 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/851 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (OVERLAPS) 1/852 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/852 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/852 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (OVERLAPS) 1/853 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/853 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/853 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (OVERLAPS) 2/855 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/855 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/855 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (OVERLAPS) 0/855 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 709 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5530 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 440/440 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/308 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 22/330 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 311/641 variables, 330/464 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 83/547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 9/556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:09] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:10] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:10] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 10/566 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:10] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:10] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:10] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:10] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 25/666 variables, 13/583 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 6/589 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:12] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:13] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 36/702 variables, 16/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/702 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:16] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:16] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/702 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/702 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 1/703 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/703 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/703 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 39/742 variables, 16/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/742 variables, 7/642 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/742 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 3/745 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/745 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:22] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/745 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/745 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 43/788 variables, 24/669 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/788 variables, 9/678 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/788 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 2/790 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/790 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/790 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 34/824 variables, 20/701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/824 variables, 5/706 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:27] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/824 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/824 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (OVERLAPS) 2/826 variables, 4/711 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/826 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/826 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (OVERLAPS) 15/841 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/841 variables, 3/724 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/841 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 1/842 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/842 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/842 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 9/851 variables, 4/730 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/851 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/851 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/851 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (OVERLAPS) 1/852 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/852 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:36] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/852 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/852 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 60 (OVERLAPS) 1/853 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/853 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/853 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 63 (OVERLAPS) 2/855 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/855 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/855 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 66 (OVERLAPS) 0/855 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 740 constraints, problems are : Problem set: 0 solved, 10 unsolved in 32630 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 440/440 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 21/21 constraints]
After SMT, in 38171ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 13128 ms.
Support contains 20 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 415/415 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 440 transition count 411
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 436 transition count 411
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 436 transition count 402
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 427 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 426 transition count 401
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 426 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 426 transition count 400
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 425 transition count 400
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 412 transition count 387
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 405 transition count 391
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 404 transition count 390
Applied a total of 71 rules in 76 ms. Remains 404 /440 variables (removed 36) and now considering 390/415 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 404/440 places, 390/415 transitions.
RANDOM walk for 40000 steps (8 resets) in 310 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
// Phase 1: matrix 390 rows 404 cols
[2025-06-05 15:16:55] [INFO ] Computed 179 invariants in 2 ms
[2025-06-05 15:16:55] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 57/75 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 221/296 variables, 105/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:55] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 286/582 variables, 296/426 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 105/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 24/606 variables, 11/542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/607 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/607 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 31/638 variables, 14/562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 6/568 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/638 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/639 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/639 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/639 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/641 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/641 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 38/679 variables, 18/589 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/679 variables, 8/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/679 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 42/721 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/721 variables, 9/626 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/721 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 1/722 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/722 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/722 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 2/724 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/724 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 41/765 variables, 24/653 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/765 variables, 7/660 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/765 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 2/767 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/767 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/767 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 14/781 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/781 variables, 4/678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/781 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 9/790 variables, 4/682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/790 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/790 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/790 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (OVERLAPS) 1/791 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/791 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/791 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 1/792 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/792 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/792 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (OVERLAPS) 2/794 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/794 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/794 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 0/794 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 691 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2644 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 404/404 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 57/75 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 221/296 variables, 105/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:58] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:58] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 286/582 variables, 296/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 105/533 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 9/542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:58] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:58] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:58] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:58] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:59] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:59] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 5/548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:59] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:59] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:59] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:59] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 24/606 variables, 11/563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/606 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/606 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 1/607 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/607 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:00] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/607 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 31/638 variables, 14/584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/638 variables, 6/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/638 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 1/639 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/639 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/639 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 2/641 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/641 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 38/679 variables, 18/611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/679 variables, 8/619 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/679 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 42/721 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/721 variables, 9/648 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/721 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 1/722 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/722 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/722 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (OVERLAPS) 2/724 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/724 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 41/765 variables, 24/675 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/765 variables, 7/682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/765 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 2/767 variables, 4/686 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/767 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/767 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (OVERLAPS) 14/781 variables, 8/696 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/781 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:05] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/781 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/781 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 9/790 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/790 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/790 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/790 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (OVERLAPS) 1/791 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/791 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/791 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (OVERLAPS) 1/792 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/792 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/792 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (OVERLAPS) 2/794 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/794 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/794 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (OVERLAPS) 0/794 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 714 constraints, problems are : Problem set: 0 solved, 9 unsolved in 9821 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 404/404 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 11/11 constraints]
After SMT, in 12475ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 2850 ms.
Support contains 18 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 390/390 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 402 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 401 transition count 387
Applied a total of 5 rules in 30 ms. Remains 401 /404 variables (removed 3) and now considering 387/390 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 401/404 places, 387/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 201255 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 9
Probabilistic random walk after 201255 steps, saw 133307 distinct states, run finished after 3008 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 387 rows 401 cols
[2025-06-05 15:17:14] [INFO ] Computed 179 invariants in 2 ms
[2025-06-05 15:17:14] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 23/96 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:14] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 122/218 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 134/352 variables, 69/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 4/356 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 8/364 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 120/484 variables, 66/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 27/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/486 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/486 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 4/490 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/490 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 110/600 variables, 56/416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/600 variables, 22/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/600 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 4/604 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/604 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/604 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 8/612 variables, 4/450 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/612 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 66/678 variables, 42/492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/678 variables, 16/508 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/678 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 1/679 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/679 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/679 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 2/681 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/681 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 57/738 variables, 30/541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/738 variables, 10/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/738 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 2/740 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/740 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/740 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 25/765 variables, 14/571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/765 variables, 6/577 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/765 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 1/766 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/766 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/766 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (OVERLAPS) 2/768 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/768 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 16/784 variables, 10/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/784 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/784 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/784 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (OVERLAPS) 1/785 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/785 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/785 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (OVERLAPS) 1/786 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/786 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/786 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (OVERLAPS) 2/788 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/788 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/788 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (OVERLAPS) 0/788 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 601 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 401/401 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 23/96 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 122/218 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 134/352 variables, 69/221 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 30/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 4/356 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/356 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 8/364 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 120/484 variables, 66/338 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 27/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:17] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/484 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 2/486 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/486 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/486 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 4/490 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/490 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 110/600 variables, 56/429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/600 variables, 22/451 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:18] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:18] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/600 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/600 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 4/604 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/604 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/604 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 8/612 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/612 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 66/678 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/678 variables, 16/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:19] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/678 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/678 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 1/679 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/679 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/679 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 2/681 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/681 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 57/738 variables, 30/557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/738 variables, 10/567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/738 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (OVERLAPS) 2/740 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/740 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/740 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 25/765 variables, 14/587 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/765 variables, 6/593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/765 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (OVERLAPS) 1/766 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/766 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/766 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (OVERLAPS) 2/768 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/768 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (OVERLAPS) 16/784 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/784 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/784 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:21] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/784 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/784 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (OVERLAPS) 1/785 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/785 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/785 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 72 (OVERLAPS) 1/786 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/786 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/786 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 75 (OVERLAPS) 2/788 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/788 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/788 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 78 (OVERLAPS) 0/788 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 788/788 variables, and 618 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7363 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 401/401 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 9506ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 2142 ms.
Support contains 18 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 387/387 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 401/401 places, 387/387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 387/387 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2025-06-05 15:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:26] [INFO ] Implicit Places using invariants in 189 ms returned [390]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 191 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/401 places, 387/387 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 399 transition count 386
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 399 transition count 386
Applied a total of 2 rules in 12 ms. Remains 399 /400 variables (removed 1) and now considering 386/387 (removed 1) transitions.
// Phase 1: matrix 386 rows 399 cols
[2025-06-05 15:17:26] [INFO ] Computed 178 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:26] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-05 15:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 15:17:26] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 399/401 places, 386/387 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 780 ms. Remains : 399/401 places, 386/387 transitions.
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
[2025-06-05 15:17:26] [INFO ] Invariant cache hit.
[2025-06-05 15:17:26] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 53/70 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/93 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 119/212 variables, 93/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 134/346 variables, 69/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 30/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/350 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 6/356 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 127/483 variables, 68/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/483 variables, 27/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/483 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3/486 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/486 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 4/490 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/490 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 110/600 variables, 56/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/600 variables, 22/436 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/600 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 4/604 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/604 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/604 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 8/612 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/612 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 66/678 variables, 42/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/678 variables, 16/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/678 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 1/679 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/679 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/679 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 2/681 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/681 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 57/738 variables, 30/539 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/738 variables, 10/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/738 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 2/740 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/740 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/740 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 25/765 variables, 14/569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/765 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/765 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 1/766 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/766 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/766 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 2/768 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/768 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 15/783 variables, 10/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/783 variables, 4/592 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/783 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 2/785 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/785 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/785 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (OVERLAPS) 0/785 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 785/785 variables, and 595 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 399/399 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 53/70 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/93 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 119/212 variables, 93/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 134/346 variables, 69/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 30/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/350 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 6/356 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/356 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/356 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/356 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 127/483 variables, 68/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/483 variables, 27/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:29] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/483 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/483 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 3/486 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/486 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/486 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 4/490 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/490 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 110/600 variables, 56/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/600 variables, 22/452 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:30] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:30] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/600 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/600 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 4/604 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/604 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/604 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 8/612 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/612 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 66/678 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/678 variables, 16/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:31] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:31] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:31] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/678 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/678 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (OVERLAPS) 1/679 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/679 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/679 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 2/681 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/681 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 57/738 variables, 30/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/738 variables, 10/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/738 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 2/740 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/740 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/740 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (OVERLAPS) 25/765 variables, 14/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/765 variables, 6/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/765 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (OVERLAPS) 1/766 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/766 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/766 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (OVERLAPS) 2/768 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/768 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (OVERLAPS) 15/783 variables, 10/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/783 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:34] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/783 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/783 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 2/785 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/785 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/785 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 0/785 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 785/785 variables, and 617 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6691 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 399/399 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 8340ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1539 ms.
Support contains 17 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 386/386 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 398 transition count 385
Applied a total of 2 rules in 11 ms. Remains 398 /399 variables (removed 1) and now considering 385/386 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 398/399 places, 385/386 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-05 15:17:36] [INFO ] Flatten gal took : 37 ms
[2025-06-05 15:17:36] [INFO ] Flatten gal took : 38 ms
[2025-06-05 15:17:36] [INFO ] Input system was already deterministic with 1108 transitions.
Computed a total of 325 stabilizing places and 325 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1186 transition count 1086
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1186 transition count 1086
Applied a total of 44 rules in 72 ms. Remains 1186 /1208 variables (removed 22) and now considering 1086/1108 (removed 22) transitions.
// Phase 1: matrix 1086 rows 1186 cols
[2025-06-05 15:17:37] [INFO ] Computed 181 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:37] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-06-05 15:17:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:38] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2025-06-05 15:17:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/2272 variables, and 0 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1186 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1185/2272 variables, and 0 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1186 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 1186/1208 places, 1086/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61408 ms. Remains : 1186/1208 places, 1086/1108 transitions.
[2025-06-05 15:18:38] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:18:38] [INFO ] Flatten gal took : 33 ms
[2025-06-05 15:18:38] [INFO ] Input system was already deterministic with 1086 transitions.
[2025-06-05 15:18:38] [INFO ] Flatten gal took : 27 ms
[2025-06-05 15:18:38] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:18:38] [INFO ] Time to serialize gal into /tmp/CTLFireability710639980278731955.gal : 18 ms
[2025-06-05 15:18:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16174728752599966079.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability710639980278731955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16174728752599966079.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:19:08] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:19:08] [INFO ] Applying decomposition
[2025-06-05 15:19:08] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11368532677129813471.txt' '-o' '/tmp/graph11368532677129813471.bin' '-w' '/tmp/graph11368532677129813471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11368532677129813471.bin' '-l' '-1' '-v' '-w' '/tmp/graph11368532677129813471.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:19:08] [INFO ] Decomposing Gal with order
[2025-06-05 15:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:19:09] [INFO ] Removed a total of 197 redundant transitions.
[2025-06-05 15:19:09] [INFO ] Flatten gal took : 92 ms
[2025-06-05 15:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-05 15:19:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1834632133838683682.gal : 26 ms
[2025-06-05 15:19:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3414860809028522668.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1834632133838683682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3414860809028522668.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1183 transition count 1083
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1181 transition count 1081
Applied a total of 54 rules in 153 ms. Remains 1181 /1208 variables (removed 27) and now considering 1081/1108 (removed 27) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2025-06-05 15:19:39] [INFO ] Computed 181 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:39] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-05 15:19:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:40] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2025-06-05 15:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/2262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/2262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 1181/1208 places, 1081/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61464 ms. Remains : 1181/1208 places, 1081/1108 transitions.
[2025-06-05 15:20:40] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:20:40] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:20:40] [INFO ] Input system was already deterministic with 1081 transitions.
[2025-06-05 15:20:40] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:20:40] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1302759288850042530.gal : 5 ms
[2025-06-05 15:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2933804965818359700.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1302759288850042530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2933804965818359700.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:21:10] [INFO ] Flatten gal took : 22 ms
[2025-06-05 15:21:10] [INFO ] Applying decomposition
[2025-06-05 15:21:10] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13152860655463347897.txt' '-o' '/tmp/graph13152860655463347897.bin' '-w' '/tmp/graph13152860655463347897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13152860655463347897.bin' '-l' '-1' '-v' '-w' '/tmp/graph13152860655463347897.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:21:11] [INFO ] Decomposing Gal with order
[2025-06-05 15:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:21:11] [INFO ] Removed a total of 203 redundant transitions.
[2025-06-05 15:21:11] [INFO ] Flatten gal took : 47 ms
[2025-06-05 15:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 15:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8752410372437819013.gal : 8 ms
[2025-06-05 15:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10618798836340159501.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8752410372437819013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10618798836340159501.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1184 transition count 1084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1182 transition count 1082
Applied a total of 52 rules in 155 ms. Remains 1182 /1208 variables (removed 26) and now considering 1082/1108 (removed 26) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2025-06-05 15:21:41] [INFO ] Computed 181 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:21:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-06-05 15:21:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:21:42] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2025-06-05 15:21:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1181/2264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1182 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 timeout
1)
(s1006 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1181/2264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1182 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 1182/1208 places, 1082/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61477 ms. Remains : 1182/1208 places, 1082/1108 transitions.
[2025-06-05 15:22:42] [INFO ] Flatten gal took : 21 ms
[2025-06-05 15:22:42] [INFO ] Flatten gal took : 22 ms
[2025-06-05 15:22:42] [INFO ] Input system was already deterministic with 1082 transitions.
[2025-06-05 15:22:42] [INFO ] Flatten gal took : 21 ms
[2025-06-05 15:22:42] [INFO ] Flatten gal took : 21 ms
[2025-06-05 15:22:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12591274037892901123.gal : 4 ms
[2025-06-05 15:22:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12147262135331622692.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12591274037892901123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12147262135331622692.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:23:12] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:23:12] [INFO ] Applying decomposition
[2025-06-05 15:23:13] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10743241931655164258.txt' '-o' '/tmp/graph10743241931655164258.bin' '-w' '/tmp/graph10743241931655164258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10743241931655164258.bin' '-l' '-1' '-v' '-w' '/tmp/graph10743241931655164258.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:23:13] [INFO ] Decomposing Gal with order
[2025-06-05 15:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:23:13] [INFO ] Removed a total of 202 redundant transitions.
[2025-06-05 15:23:13] [INFO ] Flatten gal took : 41 ms
[2025-06-05 15:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 15:23:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14797209544882435987.gal : 9 ms
[2025-06-05 15:23:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10575189798021381408.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14797209544882435987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10575189798021381408.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1186 transition count 1086
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1184 transition count 1084
Applied a total of 48 rules in 138 ms. Remains 1184 /1208 variables (removed 24) and now considering 1084/1108 (removed 24) transitions.
// Phase 1: matrix 1084 rows 1184 cols
[2025-06-05 15:23:43] [INFO ] Computed 181 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:23:43] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-06-05 15:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:23:44] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 1083 sub problems to find dead transitions.
[2025-06-05 15:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1208 places, 1084/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61459 ms. Remains : 1184/1208 places, 1084/1108 transitions.
[2025-06-05 15:24:44] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:24:44] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:24:44] [INFO ] Input system was already deterministic with 1084 transitions.
[2025-06-05 15:24:44] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:24:44] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:24:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17530376391992945421.gal : 4 ms
[2025-06-05 15:24:44] [INFO ] Time to serialize properties into /tmp/CTLFireability86147327214496618.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17530376391992945421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability86147327214496618.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:25:14] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:25:14] [INFO ] Applying decomposition
[2025-06-05 15:25:14] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7389304443568702454.txt' '-o' '/tmp/graph7389304443568702454.bin' '-w' '/tmp/graph7389304443568702454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7389304443568702454.bin' '-l' '-1' '-v' '-w' '/tmp/graph7389304443568702454.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:25:15] [INFO ] Decomposing Gal with order
[2025-06-05 15:25:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:25:15] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-05 15:25:15] [INFO ] Flatten gal took : 45 ms
[2025-06-05 15:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 15:25:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8382260545629792434.gal : 9 ms
[2025-06-05 15:25:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8227610042868958930.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8382260545629792434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8227610042868958930.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1186 transition count 1086
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1184 transition count 1084
Applied a total of 48 rules in 151 ms. Remains 1184 /1208 variables (removed 24) and now considering 1084/1108 (removed 24) transitions.
// Phase 1: matrix 1084 rows 1184 cols
[2025-06-05 15:25:45] [INFO ] Computed 181 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:25:45] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-06-05 15:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:25:46] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
Running 1083 sub problems to find dead transitions.
[2025-06-05 15:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1208 places, 1084/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61486 ms. Remains : 1184/1208 places, 1084/1108 transitions.
[2025-06-05 15:26:46] [INFO ] Flatten gal took : 19 ms
[2025-06-05 15:26:46] [INFO ] Flatten gal took : 19 ms
[2025-06-05 15:26:46] [INFO ] Input system was already deterministic with 1084 transitions.
[2025-06-05 15:26:46] [INFO ] Flatten gal took : 19 ms
[2025-06-05 15:26:46] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:26:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3084901546221406750.gal : 4 ms
[2025-06-05 15:26:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10946044689366698536.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3084901546221406750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10946044689366698536.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:27:16] [INFO ] Flatten gal took : 19 ms
[2025-06-05 15:27:16] [INFO ] Applying decomposition
[2025-06-05 15:27:16] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7584169400154633423.txt' '-o' '/tmp/graph7584169400154633423.bin' '-w' '/tmp/graph7584169400154633423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7584169400154633423.bin' '-l' '-1' '-v' '-w' '/tmp/graph7584169400154633423.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:27:16] [INFO ] Decomposing Gal with order
[2025-06-05 15:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:27:17] [INFO ] Removed a total of 198 redundant transitions.
[2025-06-05 15:27:17] [INFO ] Flatten gal took : 42 ms
[2025-06-05 15:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 15:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11923901914435866843.gal : 9 ms
[2025-06-05 15:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6200761960940358472.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11923901914435866843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6200761960940358472.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1185 transition count 1085
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1183 transition count 1083
Applied a total of 50 rules in 135 ms. Remains 1183 /1208 variables (removed 25) and now considering 1083/1108 (removed 25) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2025-06-05 15:27:47] [INFO ] Computed 181 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:27:47] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-06-05 15:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:27:48] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Running 1082 sub problems to find dead transitions.
[2025-06-05 15:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1183 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1183 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 1183/1208 places, 1083/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61461 ms. Remains : 1183/1208 places, 1083/1108 transitions.
[2025-06-05 15:28:48] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:28:48] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:28:48] [INFO ] Input system was already deterministic with 1083 transitions.
[2025-06-05 15:28:48] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:28:48] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6702033974771800061.gal : 3 ms
[2025-06-05 15:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability4130224154895318404.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6702033974771800061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4130224154895318404.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:29:18] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:29:18] [INFO ] Applying decomposition
[2025-06-05 15:29:18] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11351730883288295689.txt' '-o' '/tmp/graph11351730883288295689.bin' '-w' '/tmp/graph11351730883288295689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11351730883288295689.bin' '-l' '-1' '-v' '-w' '/tmp/graph11351730883288295689.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:29:18] [INFO ] Decomposing Gal with order
[2025-06-05 15:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:29:18] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-05 15:29:19] [INFO ] Flatten gal took : 36 ms
[2025-06-05 15:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 15:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18332873359240331133.gal : 7 ms
[2025-06-05 15:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4062428915617405314.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18332873359240331133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4062428915617405314.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1183 transition count 1083
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1181 transition count 1081
Applied a total of 54 rules in 147 ms. Remains 1181 /1208 variables (removed 27) and now considering 1081/1108 (removed 27) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2025-06-05 15:29:49] [INFO ] Computed 181 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:29:49] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-06-05 15:29:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:29:50] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2025-06-05 15:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/2262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/2262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 1181/1208 places, 1081/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61439 ms. Remains : 1181/1208 places, 1081/1108 transitions.
[2025-06-05 15:30:50] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:30:50] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:30:50] [INFO ] Input system was already deterministic with 1081 transitions.
[2025-06-05 15:30:50] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:30:50] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16147794339047660941.gal : 4 ms
[2025-06-05 15:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17305952530349274076.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16147794339047660941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17305952530349274076.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:31:20] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:31:20] [INFO ] Applying decomposition
[2025-06-05 15:31:20] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph826946153757904727.txt' '-o' '/tmp/graph826946153757904727.bin' '-w' '/tmp/graph826946153757904727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph826946153757904727.bin' '-l' '-1' '-v' '-w' '/tmp/graph826946153757904727.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:31:20] [INFO ] Decomposing Gal with order
[2025-06-05 15:31:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:31:20] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-05 15:31:20] [INFO ] Flatten gal took : 48 ms
[2025-06-05 15:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 15:31:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13865752692013804451.gal : 8 ms
[2025-06-05 15:31:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2144166834532184571.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13865752692013804451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2144166834532184571.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1186 transition count 1086
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1184 transition count 1084
Applied a total of 48 rules in 143 ms. Remains 1184 /1208 variables (removed 24) and now considering 1084/1108 (removed 24) transitions.
// Phase 1: matrix 1084 rows 1184 cols
[2025-06-05 15:31:51] [INFO ] Computed 181 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:31:51] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-05 15:31:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:31:52] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 1083 sub problems to find dead transitions.
[2025-06-05 15:31:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1208 places, 1084/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61377 ms. Remains : 1184/1208 places, 1084/1108 transitions.
[2025-06-05 15:32:52] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:32:52] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:32:52] [INFO ] Input system was already deterministic with 1084 transitions.
[2025-06-05 15:32:52] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:32:52] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:32:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16658225430787874474.gal : 3 ms
[2025-06-05 15:32:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8216594456811429106.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16658225430787874474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8216594456811429106.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:33:22] [INFO ] Flatten gal took : 22 ms
[2025-06-05 15:33:22] [INFO ] Applying decomposition
[2025-06-05 15:33:22] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9111981487423099797.txt' '-o' '/tmp/graph9111981487423099797.bin' '-w' '/tmp/graph9111981487423099797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9111981487423099797.bin' '-l' '-1' '-v' '-w' '/tmp/graph9111981487423099797.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:33:22] [INFO ] Decomposing Gal with order
[2025-06-05 15:33:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:33:22] [INFO ] Removed a total of 201 redundant transitions.
[2025-06-05 15:33:22] [INFO ] Flatten gal took : 41 ms
[2025-06-05 15:33:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:33:22] [INFO ] Time to serialize gal into /tmp/CTLFireability623807761730407594.gal : 7 ms
[2025-06-05 15:33:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14979975403560129294.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability623807761730407594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14979975403560129294.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1207 transition count 867
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 967 transition count 866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 966 transition count 866
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 482 place count 966 transition count 721
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 772 place count 821 transition count 721
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 791 place count 802 transition count 702
Iterating global reduction 3 with 19 rules applied. Total rules applied 810 place count 802 transition count 702
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 810 place count 802 transition count 685
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 844 place count 785 transition count 685
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 1 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 1480 place count 467 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1481 place count 467 transition count 366
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1483 place count 466 transition count 365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1485 place count 464 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1487 place count 462 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1487 place count 462 transition count 362
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 1489 place count 461 transition count 362
Applied a total of 1489 rules in 121 ms. Remains 461 /1208 variables (removed 747) and now considering 362/1108 (removed 746) transitions.
// Phase 1: matrix 362 rows 461 cols
[2025-06-05 15:33:52] [INFO ] Computed 179 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:33:53] [INFO ] Implicit Places using invariants in 202 ms returned [447]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 203 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 460/1208 places, 362/1108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 459 transition count 361
Applied a total of 2 rules in 14 ms. Remains 459 /460 variables (removed 1) and now considering 361/362 (removed 1) transitions.
// Phase 1: matrix 361 rows 459 cols
[2025-06-05 15:33:53] [INFO ] Computed 178 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:33:53] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 15:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:33:53] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 459/1208 places, 361/1108 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 856 ms. Remains : 459/1208 places, 361/1108 transitions.
[2025-06-05 15:33:53] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:33:53] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:33:53] [INFO ] Input system was already deterministic with 361 transitions.
[2025-06-05 15:33:53] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:33:53] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:33:53] [INFO ] Time to serialize gal into /tmp/CTLFireability5274465649797807360.gal : 2 ms
[2025-06-05 15:33:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1771118916711477383.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5274465649797807360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1771118916711477383.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70453e+69,0.386215,18572,2,1538,5,63245,6,0,2200,82295,0
Converting to forward existential form...Done !
original formula: EF(((AG((p536==0)) * (EG(EF((p1305==0))) + EG(EF((p381==0))))) * ((p1302==0)||(p693==0))))
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * ((p1302==0)||(p693==0))) * !(E(TRUE U !((p536==0))))),E(TRUE U (p1305==0)))] != FALSE...269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 15:34:23] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:34:23] [INFO ] Applying decomposition
[2025-06-05 15:34:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16325423808892018958.txt' '-o' '/tmp/graph16325423808892018958.bin' '-w' '/tmp/graph16325423808892018958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16325423808892018958.bin' '-l' '-1' '-v' '-w' '/tmp/graph16325423808892018958.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:34:23] [INFO ] Decomposing Gal with order
[2025-06-05 15:34:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:34:23] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-05 15:34:23] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:34:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 15:34:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3793273282648454984.gal : 3 ms
[2025-06-05 15:34:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10970897486001494652.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3793273282648454984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10970897486001494652.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70453e+69,0.229983,13448,88,18,20300,146,584,35362,52,713,0
Converting to forward existential form...Done !
original formula: EF(((AG((i8.i0.u62.p536==0)) * (EG(EF((i18.i2.u152.p1305==0))) + EG(EF((i5.i1.u43.p381==0))))) * ((i18.i2.u151.p1302==0)||(i9.i3.u80.p693...162
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * ((i18.i2.u151.p1302==0)||(i9.i3.u80.p693==0))) * !(E(TRUE U !((i8.i0.u62.p536==0)))))...355
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1185 transition count 1085
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1183 transition count 1083
Applied a total of 50 rules in 149 ms. Remains 1183 /1208 variables (removed 25) and now considering 1083/1108 (removed 25) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2025-06-05 15:34:54] [INFO ] Computed 181 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:34:54] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-06-05 15:34:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:34:55] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
Running 1082 sub problems to find dead transitions.
[2025-06-05 15:34:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1183 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(timeout
s832 1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1183 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 1183/1208 places, 1083/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61464 ms. Remains : 1183/1208 places, 1083/1108 transitions.
[2025-06-05 15:35:55] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:35:55] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:35:55] [INFO ] Input system was already deterministic with 1083 transitions.
[2025-06-05 15:35:55] [INFO ] Flatten gal took : 19 ms
[2025-06-05 15:35:55] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:35:55] [INFO ] Time to serialize gal into /tmp/CTLFireability966351779710060945.gal : 4 ms
[2025-06-05 15:35:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16557328681189920755.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability966351779710060945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16557328681189920755.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:36:25] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:36:25] [INFO ] Applying decomposition
[2025-06-05 15:36:25] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7590714298232398728.txt' '-o' '/tmp/graph7590714298232398728.bin' '-w' '/tmp/graph7590714298232398728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7590714298232398728.bin' '-l' '-1' '-v' '-w' '/tmp/graph7590714298232398728.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:36:25] [INFO ] Decomposing Gal with order
[2025-06-05 15:36:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:36:25] [INFO ] Removed a total of 201 redundant transitions.
[2025-06-05 15:36:25] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:36:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:36:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12924850350412707506.gal : 7 ms
[2025-06-05 15:36:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9836232358370147194.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12924850350412707506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9836232358370147194.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1184 transition count 1084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1182 transition count 1082
Applied a total of 52 rules in 154 ms. Remains 1182 /1208 variables (removed 26) and now considering 1082/1108 (removed 26) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2025-06-05 15:36:55] [INFO ] Computed 181 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:36:56] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-05 15:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:36:57] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2025-06-05 15:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1181/2264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1182 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1181/2264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1182 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 1182/1208 places, 1082/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61483 ms. Remains : 1182/1208 places, 1082/1108 transitions.
[2025-06-05 15:37:57] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:37:57] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:37:57] [INFO ] Input system was already deterministic with 1082 transitions.
[2025-06-05 15:37:57] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:37:57] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:37:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11766475559755336321.gal : 3 ms
[2025-06-05 15:37:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2996550939007590066.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11766475559755336321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2996550939007590066.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:38:27] [INFO ] Flatten gal took : 22 ms
[2025-06-05 15:38:27] [INFO ] Applying decomposition
[2025-06-05 15:38:27] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1306257347930522506.txt' '-o' '/tmp/graph1306257347930522506.bin' '-w' '/tmp/graph1306257347930522506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1306257347930522506.bin' '-l' '-1' '-v' '-w' '/tmp/graph1306257347930522506.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:38:27] [INFO ] Decomposing Gal with order
[2025-06-05 15:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:38:27] [INFO ] Removed a total of 202 redundant transitions.
[2025-06-05 15:38:27] [INFO ] Flatten gal took : 33 ms
[2025-06-05 15:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:38:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14103492338799698020.gal : 7 ms
[2025-06-05 15:38:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10064174313762565134.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14103492338799698020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10064174313762565134.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1207 transition count 863
Reduce places removed 244 places and 0 transitions.
Iterating post reduction 1 with 244 rules applied. Total rules applied 488 place count 963 transition count 863
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 144 Pre rules applied. Total rules applied 488 place count 963 transition count 719
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 776 place count 819 transition count 719
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 796 place count 799 transition count 699
Iterating global reduction 2 with 20 rules applied. Total rules applied 816 place count 799 transition count 699
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 816 place count 799 transition count 681
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 852 place count 781 transition count 681
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1488 place count 463 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1489 place count 463 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1491 place count 462 transition count 361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1493 place count 460 transition count 359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1495 place count 458 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1495 place count 458 transition count 358
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 1497 place count 457 transition count 358
Applied a total of 1497 rules in 124 ms. Remains 457 /1208 variables (removed 751) and now considering 358/1108 (removed 750) transitions.
// Phase 1: matrix 358 rows 457 cols
[2025-06-05 15:38:57] [INFO ] Computed 179 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:58] [INFO ] Implicit Places using invariants in 203 ms returned [443]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 456/1208 places, 358/1108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 357
Applied a total of 2 rules in 14 ms. Remains 455 /456 variables (removed 1) and now considering 357/358 (removed 1) transitions.
// Phase 1: matrix 357 rows 455 cols
[2025-06-05 15:38:58] [INFO ] Computed 178 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:58] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-05 15:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:58] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 455/1208 places, 357/1108 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 861 ms. Remains : 455/1208 places, 357/1108 transitions.
[2025-06-05 15:38:58] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:38:58] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:38:58] [INFO ] Input system was already deterministic with 357 transitions.
[2025-06-05 15:38:58] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:38:58] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:38:58] [INFO ] Time to serialize gal into /tmp/CTLFireability261857927267769218.gal : 1 ms
[2025-06-05 15:38:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4087979725884358301.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability261857927267769218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4087979725884358301.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8892e+69,0.36952,18232,2,1535,5,61288,6,0,2180,79955,0
Converting to forward existential form...Done !
original formula: AG(AF((p686==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p686==0)))] = FALSE
Hit Full ! (commute/partial/dont) 355/0/2
(forward)formula 0,0,1.4081,54312,1,0,8,369491,20,2,10860,79955,8
FORMULA ShieldIIPt-PT-020B-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1207 transition count 868
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 480 place count 968 transition count 866
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 966 transition count 866
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 144 Pre rules applied. Total rules applied 482 place count 966 transition count 722
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 770 place count 822 transition count 722
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 787 place count 805 transition count 705
Iterating global reduction 3 with 17 rules applied. Total rules applied 804 place count 805 transition count 705
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 804 place count 805 transition count 690
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 834 place count 790 transition count 690
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 1470 place count 472 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1471 place count 472 transition count 371
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1473 place count 471 transition count 370
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1475 place count 469 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1477 place count 467 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1477 place count 467 transition count 367
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 1479 place count 466 transition count 367
Applied a total of 1479 rules in 116 ms. Remains 466 /1208 variables (removed 742) and now considering 367/1108 (removed 741) transitions.
// Phase 1: matrix 367 rows 466 cols
[2025-06-05 15:39:00] [INFO ] Computed 179 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:00] [INFO ] Implicit Places using invariants in 181 ms returned [452]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 465/1208 places, 367/1108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 366
Applied a total of 2 rules in 13 ms. Remains 464 /465 variables (removed 1) and now considering 366/367 (removed 1) transitions.
// Phase 1: matrix 366 rows 464 cols
[2025-06-05 15:39:00] [INFO ] Computed 178 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:00] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-05 15:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:00] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 464/1208 places, 366/1108 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 837 ms. Remains : 464/1208 places, 366/1108 transitions.
[2025-06-05 15:39:00] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:39:00] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:39:00] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-05 15:39:00] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:39:00] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15601632015745301667.gal : 1 ms
[2025-06-05 15:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13312590209207040211.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15601632015745301667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13312590209207040211.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64363e+70,0.69788,29492,2,1664,5,106879,6,0,2223,157109,0
Converting to forward existential form...Done !
original formula: (E((!(EF((p114!=1))) * AF((p50==1))) U !(EG(!((((p1237==1)&&(p678==1))&&(p468==1)))))) + A((p1090!=1) U (p128==1)))
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(TRUE U (p114!=1))) * !(EG(!((p50==1)))))) * !(EG(!((((p1237==1)&&(p678==1))&&(p468==1))))))] !...261
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t22, t28, t88, t92, t94, t96, t103, t260, t282, t286, t289, t325, Intersection w...240
Detected timeout of ITS tools.
[2025-06-05 15:39:31] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:39:31] [INFO ] Applying decomposition
[2025-06-05 15:39:31] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17620637848292523043.txt' '-o' '/tmp/graph17620637848292523043.bin' '-w' '/tmp/graph17620637848292523043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17620637848292523043.bin' '-l' '-1' '-v' '-w' '/tmp/graph17620637848292523043.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:39:31] [INFO ] Decomposing Gal with order
[2025-06-05 15:39:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:39:31] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-05 15:39:31] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 15:39:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1823519965091495231.gal : 2 ms
[2025-06-05 15:39:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5891858747112266562.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1823519965091495231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5891858747112266562.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64363e+70,0.537103,26480,144,28,49420,158,609,98734,50,1047,0
Converting to forward existential form...Done !
original formula: (E((!(EF((i2.i1.u12.p114!=1))) * AF((i1.i1.u5.p50==1))) U !(EG(!((((i17.i1.u144.p1237==1)&&(i9.i1.u79.p678==1))&&(i5.i2.u54.p468==1))))))...206
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(TRUE U (i2.i1.u12.p114!=1))) * !(EG(!((i1.i1.u5.p50==1)))))) * !(EG(!((((i17.i1.u144.p1237==1)...354
Reverse transition relation is NOT exact ! Due to transitions t286, t289, t325, i0.i0.u7.t94, i0.i1.u2.t0, i0.i1.u6.t92, i0.i2.u8.t96, i1.i0.u10.t1, i1.i0....350
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1184 transition count 1084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1182 transition count 1082
Applied a total of 52 rules in 130 ms. Remains 1182 /1208 variables (removed 26) and now considering 1082/1108 (removed 26) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2025-06-05 15:40:01] [INFO ] Computed 181 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:40:01] [INFO ] Implicit Places using invariants in 306 ms returned []
[2025-06-05 15:40:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:40:02] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2025-06-05 15:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1181/2264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1182 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1181/2264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1182 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 1182/1208 places, 1082/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61416 ms. Remains : 1182/1208 places, 1082/1108 transitions.
[2025-06-05 15:41:02] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:41:02] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:41:02] [INFO ] Input system was already deterministic with 1082 transitions.
[2025-06-05 15:41:02] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:41:02] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:41:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6116736576581413471.gal : 3 ms
[2025-06-05 15:41:02] [INFO ] Time to serialize properties into /tmp/CTLFireability18379218654882321899.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6116736576581413471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18379218654882321899.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:41:32] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:41:32] [INFO ] Applying decomposition
[2025-06-05 15:41:32] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7768990363463021807.txt' '-o' '/tmp/graph7768990363463021807.bin' '-w' '/tmp/graph7768990363463021807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7768990363463021807.bin' '-l' '-1' '-v' '-w' '/tmp/graph7768990363463021807.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:41:32] [INFO ] Decomposing Gal with order
[2025-06-05 15:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:41:32] [INFO ] Removed a total of 201 redundant transitions.
[2025-06-05 15:41:32] [INFO ] Flatten gal took : 35 ms
[2025-06-05 15:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:41:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3872560085249255753.gal : 6 ms
[2025-06-05 15:41:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3745952484875746183.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3872560085249255753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3745952484875746183.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1186 transition count 1086
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1184 transition count 1084
Applied a total of 48 rules in 141 ms. Remains 1184 /1208 variables (removed 24) and now considering 1084/1108 (removed 24) transitions.
// Phase 1: matrix 1084 rows 1184 cols
[2025-06-05 15:42:03] [INFO ] Computed 181 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:42:03] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-06-05 15:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:42:04] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 1083 sub problems to find dead transitions.
[2025-06-05 15:42:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 1083/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1083 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 0/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1208 places, 1084/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61412 ms. Remains : 1184/1208 places, 1084/1108 transitions.
[2025-06-05 15:43:04] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:43:04] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:43:04] [INFO ] Input system was already deterministic with 1084 transitions.
[2025-06-05 15:43:04] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:43:04] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16937600056837272209.gal : 3 ms
[2025-06-05 15:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12758497465233579982.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16937600056837272209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12758497465233579982.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:43:34] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:43:34] [INFO ] Applying decomposition
[2025-06-05 15:43:34] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9910336623522693064.txt' '-o' '/tmp/graph9910336623522693064.bin' '-w' '/tmp/graph9910336623522693064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9910336623522693064.bin' '-l' '-1' '-v' '-w' '/tmp/graph9910336623522693064.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:43:34] [INFO ] Decomposing Gal with order
[2025-06-05 15:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:43:34] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-05 15:43:34] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:43:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17285576175445087807.gal : 7 ms
[2025-06-05 15:43:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11312979671697176662.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17285576175445087807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11312979671697176662.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1108/1108 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1183 transition count 1083
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1181 transition count 1081
Applied a total of 54 rules in 137 ms. Remains 1181 /1208 variables (removed 27) and now considering 1081/1108 (removed 27) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2025-06-05 15:44:05] [INFO ] Computed 181 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:44:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-05 15:44:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:44:06] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2025-06-05 15:44:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/2262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/2262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 1181/1208 places, 1081/1108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61456 ms. Remains : 1181/1208 places, 1081/1108 transitions.
[2025-06-05 15:45:06] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:45:06] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:45:06] [INFO ] Input system was already deterministic with 1081 transitions.
[2025-06-05 15:45:06] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:45:06] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8836104639917388114.gal : 3 ms
[2025-06-05 15:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8922862655159463337.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8836104639917388114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8922862655159463337.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:45:36] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:45:36] [INFO ] Applying decomposition
[2025-06-05 15:45:36] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph97119092959551486.txt' '-o' '/tmp/graph97119092959551486.bin' '-w' '/tmp/graph97119092959551486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph97119092959551486.bin' '-l' '-1' '-v' '-w' '/tmp/graph97119092959551486.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:45:36] [INFO ] Decomposing Gal with order
[2025-06-05 15:45:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:45:36] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-05 15:45:36] [INFO ] Flatten gal took : 30 ms
[2025-06-05 15:45:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:45:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10024025389080089268.gal : 7 ms
[2025-06-05 15:45:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1542026926978963802.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10024025389080089268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1542026926978963802.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 15:46:06] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:46:06] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:46:06] [INFO ] Applying decomposition
[2025-06-05 15:46:06] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8815197949436864007.txt' '-o' '/tmp/graph8815197949436864007.bin' '-w' '/tmp/graph8815197949436864007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8815197949436864007.bin' '-l' '-1' '-v' '-w' '/tmp/graph8815197949436864007.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:46:06] [INFO ] Decomposing Gal with order
[2025-06-05 15:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:46:06] [INFO ] Removed a total of 184 redundant transitions.
[2025-06-05 15:46:07] [INFO ] Flatten gal took : 32 ms
[2025-06-05 15:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:46:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6404839314783479353.gal : 8 ms
[2025-06-05 15:46:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11545221250778187501.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6404839314783479353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11545221250778187501.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 itstools"
echo " Input is ShieldIIPt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894532900530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;