Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761500634.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761500634
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717012029221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 19:47:10] [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]
[2024-05-29 19:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:47:10] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-29 19:47:10] [INFO ] Transformed 1563 places.
[2024-05-29 19:47:10] [INFO ] Transformed 1423 transitions.
[2024-05-29 19:47:10] [INFO ] Found NUPN structural information;
[2024-05-29 19:47:10] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 103 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 1369 transition count 1229
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 1369 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 389 place count 1368 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 390 place count 1368 transition count 1228
Applied a total of 390 rules in 402 ms. Remains 1368 /1563 variables (removed 195) and now considering 1228/1423 (removed 195) transitions.
// Phase 1: matrix 1228 rows 1368 cols
[2024-05-29 19:47:11] [INFO ] Computed 221 invariants in 17 ms
[2024-05-29 19:47:11] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-29 19:47:11] [INFO ] Invariant cache hit.
[2024-05-29 19:47:12] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 1227 sub problems to find dead transitions.
[2024-05-29 19:47:12] [INFO ] Invariant cache hit.
(s966 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.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0timeout
)
(s967 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1227 unsolved
SMT process timed out in 30325ms, After SMT, problems are : Problem set: 0 solved, 1227 unsolved
Search for dead transitions found 0 dead transitions in 30355ms
Starting structural reductions in LTL mode, iteration 1 : 1368/1563 places, 1228/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32310 ms. Remains : 1368/1563 places, 1228/1423 transitions.
Support contains 103 out of 1368 places after structural reductions.
[2024-05-29 19:47:43] [INFO ] Flatten gal took : 104 ms
[2024-05-29 19:47:43] [INFO ] Flatten gal took : 61 ms
[2024-05-29 19:47:43] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40000 steps (8 resets) in 2623 ms. (15 steps per ms) remains 41/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
[2024-05-29 19:47:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 516/584 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 784/1368 variables, 144/221 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1368 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1228/2596 variables, 1368/1589 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2596 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/2596 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2596/2596 variables, and 1589 constraints, problems are : Problem set: 0 solved, 41 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1368/1368 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 516/584 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 19:47:49] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 7 ms to minimize.
[2024-05-29 19:47:49] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-29 19:47:49] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 784/1368 variables, 144/225 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 3 ms to minimize.
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:47:51] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:47:52] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1368 variables, 17/242 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1368 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1228/2596 variables, 1368/1610 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2596/2596 variables, and 1651 constraints, problems are : Problem set: 0 solved, 41 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1368/1368 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 21/21 constraints]
After SMT, in 9666ms problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 1368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1368 transition count 991
Reduce places removed 237 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 241 rules applied. Total rules applied 478 place count 1131 transition count 987
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 482 place count 1127 transition count 987
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 482 place count 1127 transition count 836
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 784 place count 976 transition count 836
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 792 place count 968 transition count 828
Iterating global reduction 3 with 8 rules applied. Total rules applied 800 place count 968 transition count 828
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 800 place count 968 transition count 821
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 814 place count 961 transition count 821
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 327
Deduced a syphon composed of 327 places in 1 ms
Reduce places removed 327 places and 0 transitions.
Iterating global reduction 3 with 654 rules applied. Total rules applied 1468 place count 634 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 634 transition count 493
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 1471 place count 633 transition count 492
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1565 place count 586 transition count 492
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1572 place count 586 transition count 485
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1579 place count 579 transition count 485
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 1629 place count 579 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1630 place count 578 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1631 place count 577 transition count 484
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1631 place count 577 transition count 482
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1635 place count 575 transition count 482
Applied a total of 1635 rules in 328 ms. Remains 575 /1368 variables (removed 793) and now considering 482/1228 (removed 746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 575/1368 places, 482/1228 transitions.
RANDOM walk for 40000 steps (8 resets) in 666 ms. (59 steps per ms) remains 9/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/8 properties
// Phase 1: matrix 482 rows 575 cols
[2024-05-29 19:47:55] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:47:55] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 90/106 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 35/141 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 146/287 variables, 141/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 152/439 variables, 77/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 18/298 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 20/459 variables, 18/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 13/330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 46/505 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 168/673 variables, 106/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/673 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/673 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 27/700 variables, 18/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 10/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 12/712 variables, 6/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/712 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/712 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 119/831 variables, 88/598 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/831 variables, 18/616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/831 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/831 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 16/847 variables, 11/628 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/847 variables, 5/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/847 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 11/858 variables, 5/638 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/858 variables, 2/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/858 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 51/909 variables, 40/680 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/909 variables, 7/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/909 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 4/913 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/913 variables, 4/694 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/913 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (OVERLAPS) 4/917 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/917 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 24/941 variables, 17/713 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/941 variables, 5/718 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/941 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/941 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (OVERLAPS) 2/943 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/943 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 20/963 variables, 10/730 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/963 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/963 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 2/965 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/965 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/965 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (OVERLAPS) 4/969 variables, 2/738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/969 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 21/990 variables, 15/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/990 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/990 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 19/1009 variables, 8/766 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1009 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1009 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1009 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (OVERLAPS) 2/1011 variables, 2/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1011 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1011 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 4/1015 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1015 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (OVERLAPS) 18/1033 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1033 variables, 5/794 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1033 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 13/1046 variables, 6/800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1046 variables, 2/802 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1046 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1046 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 1/1047 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1047 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1047 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (OVERLAPS) 1/1048 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1048 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1048 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (OVERLAPS) 9/1057 variables, 6/813 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1057 variables, 3/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1057 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (OVERLAPS) 0/1057 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 816 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2739 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 575/575 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 90/106 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:47:58] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 35/141 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:47:58] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:47:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 146/287 variables, 141/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 15/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 152/439 variables, 77/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 18/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:47:58] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 20/459 variables, 18/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 13/341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 46/505 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 168/673 variables, 106/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/673 variables, 12/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/673 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:47:58] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/673 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/673 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 27/700 variables, 18/504 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/700 variables, 10/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/700 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 12/712 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/712 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:47:59] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/712 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/712 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 119/831 variables, 88/611 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/831 variables, 18/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/831 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:47:59] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:47:59] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:47:59] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/831 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/831 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 16/847 variables, 11/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/847 variables, 5/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/847 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 11/858 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/858 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/858 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 51/909 variables, 40/696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/909 variables, 7/703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/909 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 4/913 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/913 variables, 4/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/913 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 4/917 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 19:48:00] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/917 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/917 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 24/941 variables, 17/730 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/941 variables, 5/735 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/941 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/941 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 2/943 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/943 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (OVERLAPS) 20/963 variables, 10/747 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/963 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/963 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (OVERLAPS) 2/965 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/965 variables, 2/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/965 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (OVERLAPS) 4/969 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/969 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 21/990 variables, 15/770 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/990 variables, 5/775 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/990 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (OVERLAPS) 19/1009 variables, 8/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1009 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1009 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1009 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 2/1011 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1011 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1011 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 4/1015 variables, 2/792 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1015 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 18/1033 variables, 14/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1033 variables, 5/811 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1033 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (OVERLAPS) 13/1046 variables, 6/817 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1046 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1046 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1046 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (OVERLAPS) 1/1047 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1047 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1047 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 1/1048 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1048 variables, 1/824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1048 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (OVERLAPS) 9/1057 variables, 6/830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1057 variables, 3/833 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1057 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (OVERLAPS) 0/1057 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 833 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 575/575 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 7599ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1151 ms.
Support contains 16 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 482/482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 575 transition count 465
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 558 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 557 transition count 464
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 36 place count 557 transition count 455
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 54 place count 548 transition count 455
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 547 transition count 453
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 547 transition count 453
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 84 place count 533 transition count 439
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
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 102 place count 524 transition count 439
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 524 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 523 transition count 438
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 523 transition count 438
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 116 place count 517 transition count 432
Applied a total of 116 rules in 127 ms. Remains 517 /575 variables (removed 58) and now considering 432/482 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 517/575 places, 432/482 transitions.
RANDOM walk for 40000 steps (8 resets) in 377 ms. (105 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/6 properties
// Phase 1: matrix 432 rows 517 cols
[2024-05-29 19:48:04] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:48:04] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/57 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/87 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 94/181 variables, 87/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 102/283 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 17/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 8/291 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 32/323 variables, 15/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/323 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 145/468 variables, 88/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 16/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/468 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 12/480 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 12/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/480 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 16/496 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/496 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 147/643 variables, 88/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/643 variables, 25/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/643 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/643 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 10/653 variables, 9/497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/653 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/653 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 14/667 variables, 7/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/667 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/667 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 92/759 variables, 58/574 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/759 variables, 18/592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/759 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 4/763 variables, 4/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/763 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/763 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 8/771 variables, 4/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/771 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 51/822 variables, 36/640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/822 variables, 12/652 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/822 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 1/823 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/823 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/823 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 2/825 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/825 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 27/852 variables, 14/670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/852 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/852 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/852 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (OVERLAPS) 4/856 variables, 3/677 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/856 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/856 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (OVERLAPS) 4/860 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/860 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 22/882 variables, 17/698 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/882 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/882 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 19/901 variables, 8/711 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/901 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/901 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/901 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (OVERLAPS) 2/903 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/903 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/903 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (OVERLAPS) 4/907 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/907 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 18/925 variables, 14/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/925 variables, 5/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/925 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 13/938 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/938 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/938 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/938 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (OVERLAPS) 1/939 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/939 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/939 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (OVERLAPS) 1/940 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/940 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/940 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (OVERLAPS) 9/949 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/949 variables, 3/761 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/949 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (OVERLAPS) 0/949 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 949/949 variables, and 761 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 517/517 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/57 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 30/87 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 94/181 variables, 87/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 102/283 variables, 54/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 17/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 8/291 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/291 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/291 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/291 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 32/323 variables, 15/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/323 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 145/468 variables, 88/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/468 variables, 16/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/468 variables, 7/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/468 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 12/480 variables, 12/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/480 variables, 12/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/480 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 16/496 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:48:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/496 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/496 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 147/643 variables, 88/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/643 variables, 25/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/643 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/643 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 10/653 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/653 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/653 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 14/667 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/667 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/667 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 92/759 variables, 58/589 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/759 variables, 18/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/759 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 4/763 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/763 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/763 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 8/771 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/771 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 51/822 variables, 36/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/822 variables, 12/667 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/822 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/822 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 1/823 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/823 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/823 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 2/825 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/825 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 27/852 variables, 14/685 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/852 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/852 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/852 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 4/856 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/856 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/856 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 4/860 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/860 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 22/882 variables, 17/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/882 variables, 5/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/882 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 19/901 variables, 8/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/901 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/901 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/901 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 2/903 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/903 variables, 2/733 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/903 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (OVERLAPS) 4/907 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/907 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (OVERLAPS) 18/925 variables, 14/749 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/925 variables, 5/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/925 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (OVERLAPS) 13/938 variables, 6/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/938 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/938 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/938 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (OVERLAPS) 1/939 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/939 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/939 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (OVERLAPS) 1/940 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/940 variables, 1/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/940 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (OVERLAPS) 9/949 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/949 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/949 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (OVERLAPS) 0/949 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 949/949 variables, and 776 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3023 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 517/517 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 4889ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 907 ms.
Support contains 10 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 432/432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 517 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 515 transition count 430
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 513 transition count 428
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 513 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 512 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 510 transition count 425
Applied a total of 12 rules in 62 ms. Remains 510 /517 variables (removed 7) and now considering 425/432 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 510/517 places, 425/432 transitions.
RANDOM walk for 40000 steps (8 resets) in 418 ms. (95 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
// Phase 1: matrix 425 rows 510 cols
[2024-05-29 19:48:10] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:48:10] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:10] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 3 ms to minimize.
[2024-05-29 19:48:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:48:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 65/130 variables, 65/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 48/178 variables, 26/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/180 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/184 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 64/248 variables, 30/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/248 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/256 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/256 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/264 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/264 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 80/344 variables, 46/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/344 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/344 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/348 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/348 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 8/356 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/356 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 78/434 variables, 46/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/434 variables, 14/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/434 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 4/438 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/438 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/438 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 8/446 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/446 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 69/515 variables, 42/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/515 variables, 13/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/515 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/515 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 3/518 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/518 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/518 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 6/524 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/524 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/524 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 48/572 variables, 25/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/572 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/572 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/572 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 3/575 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/575 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/575 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 4/579 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/579 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 38/617 variables, 23/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/617 variables, 7/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/617 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 3/620 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/620 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/620 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 4/624 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/624 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 41/665 variables, 25/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/665 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/665 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/665 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/667 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/667 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/667 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 4/671 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/671 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 37/708 variables, 22/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/708 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/708 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 2/710 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/710 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/710 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 4/714 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/714 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 34/748 variables, 21/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/748 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/748 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/748 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 1/749 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/749 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/749 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 1/750 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/750 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/750 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 28/778 variables, 14/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/778 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/778 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 3/781 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/781 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/781 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 4/785 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/785 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 21/806 variables, 15/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/806 variables, 5/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/806 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 19/825 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/825 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/825 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 2/827 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/827 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/827 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 4/831 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/831 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 21/852 variables, 15/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/852 variables, 5/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/852 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 19/871 variables, 8/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/871 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/871 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 2/873 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/873 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/873 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/877 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/877 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (OVERLAPS) 23/900 variables, 15/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/900 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/900 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (OVERLAPS) 1/901 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/901 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/901 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 16/917 variables, 8/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/917 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/917 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (OVERLAPS) 3/920 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/920 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/920 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (OVERLAPS) 4/924 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/924 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 11/935 variables, 12/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/935 variables, 3/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/935 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (OVERLAPS) 0/935 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 749 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 510/510 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/65 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/130 variables, 65/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 48/178 variables, 26/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:12] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:48:12] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/178 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/180 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/184 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/184 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 64/248 variables, 30/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/248 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/248 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/256 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/256 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/256 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 8/264 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/264 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 80/344 variables, 46/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/344 variables, 14/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/344 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 4/348 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/348 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/348 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/348 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 8/356 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/356 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 78/434 variables, 46/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/434 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/434 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 4/438 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/438 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/438 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 8/446 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/446 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 69/515 variables, 42/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/515 variables, 13/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/515 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/515 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 3/518 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/518 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/518 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 6/524 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/524 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/524 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 48/572 variables, 25/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/572 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/572 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/572 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 3/575 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/575 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/575 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/579 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/579 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 38/617 variables, 23/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/617 variables, 7/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/617 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 3/620 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/620 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/620 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 4/624 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/624 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 41/665 variables, 25/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/665 variables, 7/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/665 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/665 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 2/667 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/667 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/667 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 4/671 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/671 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 37/708 variables, 22/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/708 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/708 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 2/710 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/710 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/710 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 4/714 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/714 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 34/748 variables, 21/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/748 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/748 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/748 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 1/749 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/749 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/749 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 1/750 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/750 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/750 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 28/778 variables, 14/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/778 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/778 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 3/781 variables, 3/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/781 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/781 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 4/785 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/785 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 21/806 variables, 15/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/806 variables, 5/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 19/825 variables, 8/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/825 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/825 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 2/827 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/827 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/827 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/831 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/831 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (OVERLAPS) 21/852 variables, 15/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/852 variables, 5/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/852 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (OVERLAPS) 19/871 variables, 8/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/871 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/871 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (OVERLAPS) 2/873 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/873 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/873 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 4/877 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/877 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 23/900 variables, 15/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/900 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/900 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (OVERLAPS) 1/901 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/901 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/901 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 16/917 variables, 8/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/917 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/917 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (OVERLAPS) 3/920 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/920 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/920 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (OVERLAPS) 4/924 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/924 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 11/935 variables, 12/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/935 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/935 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (OVERLAPS) 0/935 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 755 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 510/510 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2950ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 295 ms.
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 425/425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 510 transition count 423
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 508 transition count 423
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 508 transition count 422
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 507 transition count 422
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 505 transition count 420
Applied a total of 10 rules in 33 ms. Remains 505 /510 variables (removed 5) and now considering 420/425 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 505/510 places, 420/425 transitions.
RANDOM walk for 40000 steps (8 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 292345 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 292345 steps, saw 222597 distinct states, run finished after 3007 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 420 rows 505 cols
[2024-05-29 19:48:17] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:48:17] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:17] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:48:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 65/130 variables, 65/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 48/178 variables, 26/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/180 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/184 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 64/248 variables, 30/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/248 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/248 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/256 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/256 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/264 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/264 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 80/344 variables, 46/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/344 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/344 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/348 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/348 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 8/356 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/356 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 78/434 variables, 46/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/434 variables, 14/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/434 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 4/438 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/438 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/438 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 8/446 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/446 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 69/515 variables, 42/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/515 variables, 13/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/515 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/515 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 3/518 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/518 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/518 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 6/524 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/524 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/524 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 45/569 variables, 25/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/569 variables, 9/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/569 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/569 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 2/571 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/571 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/571 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 4/575 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/575 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 40/615 variables, 23/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/615 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/615 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 2/617 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/617 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/617 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 4/621 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/621 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 40/661 variables, 23/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/661 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/661 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/661 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/663 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/663 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/663 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 4/667 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/667 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 37/704 variables, 22/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/704 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/704 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 2/706 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/706 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/706 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 4/710 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/710 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 35/745 variables, 21/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/745 variables, 7/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/745 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/745 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 1/746 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/746 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/746 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 1/747 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/747 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/747 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 26/773 variables, 14/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/773 variables, 5/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/773 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 2/775 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/775 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/775 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 4/779 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/779 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 21/800 variables, 15/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/800 variables, 5/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/800 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 19/819 variables, 8/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/819 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/819 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 2/821 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/821 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/821 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 4/825 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/825 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 21/846 variables, 15/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/846 variables, 5/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/846 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 19/865 variables, 8/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/865 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/865 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 2/867 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/867 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/867 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/871 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/871 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (OVERLAPS) 22/893 variables, 15/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/893 variables, 5/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/893 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (OVERLAPS) 16/909 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/909 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/909 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 2/911 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/911 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/911 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (OVERLAPS) 4/915 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/915 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (OVERLAPS) 10/925 variables, 10/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/925 variables, 3/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/925 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 0/925 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 744 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 505/505 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:18] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/65 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/130 variables, 65/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:18] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 48/178 variables, 26/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/178 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/180 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/180 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/184 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:18] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/184 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/184 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 64/248 variables, 30/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/248 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/248 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 8/256 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/256 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/256 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 8/264 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/264 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 80/344 variables, 46/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/344 variables, 14/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:18] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/344 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/344 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 4/348 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/348 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/348 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 8/356 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/356 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 78/434 variables, 46/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/434 variables, 14/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/434 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 4/438 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/438 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/438 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 8/446 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/446 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 69/515 variables, 42/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/515 variables, 13/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/515 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:19] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/515 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/515 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 3/518 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/518 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/518 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 6/524 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/524 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/524 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 45/569 variables, 25/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/569 variables, 9/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/569 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/569 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/571 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/571 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/571 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 4/575 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/575 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 40/615 variables, 23/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/615 variables, 7/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/615 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 2/617 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/617 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/617 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 4/621 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/621 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 40/661 variables, 23/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/661 variables, 7/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/661 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/661 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 2/663 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/663 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/663 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 4/667 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/667 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 37/704 variables, 22/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/704 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/704 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 2/706 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/706 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/706 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 4/710 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/710 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 35/745 variables, 21/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/745 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/745 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/745 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 1/746 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/746 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/746 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 1/747 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/747 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/747 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 26/773 variables, 14/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/773 variables, 5/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/773 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 2/775 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/775 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/775 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 4/779 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/779 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 21/800 variables, 15/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/800 variables, 5/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/800 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 19/819 variables, 8/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/819 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/819 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 2/821 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/821 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/821 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 4/825 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/825 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (OVERLAPS) 21/846 variables, 15/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/846 variables, 5/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/846 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (OVERLAPS) 19/865 variables, 8/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/865 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/865 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 2/867 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/867 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/867 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (OVERLAPS) 4/871 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/871 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (OVERLAPS) 22/893 variables, 15/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/893 variables, 5/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/893 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 16/909 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/909 variables, 2/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/909 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (OVERLAPS) 2/911 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/911 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/911 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (OVERLAPS) 4/915 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/915 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 10/925 variables, 10/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/925 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/925 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (OVERLAPS) 0/925 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 752 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 505/505 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 2962ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 430 ms.
Support contains 5 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 420/420 transitions.
Applied a total of 0 rules in 9 ms. Remains 505 /505 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 505/505 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 420/420 transitions.
Applied a total of 0 rules in 8 ms. Remains 505 /505 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-29 19:48:20] [INFO ] Invariant cache hit.
[2024-05-29 19:48:20] [INFO ] Implicit Places using invariants in 243 ms returned [488, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 245 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 503/505 places, 420/420 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 501 transition count 418
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 418
Applied a total of 4 rules in 19 ms. Remains 501 /503 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 501 cols
[2024-05-29 19:48:20] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 19:48:21] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-29 19:48:21] [INFO ] Invariant cache hit.
[2024-05-29 19:48:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-29 19:48:21] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 501/505 places, 418/420 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 961 ms. Remains : 501/505 places, 418/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 300354 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 300354 steps, saw 228242 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-29 19:48:24] [INFO ] Invariant cache hit.
[2024-05-29 19:48:24] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 65/130 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 48/178 variables, 26/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/180 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/184 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 64/248 variables, 30/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/248 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/248 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/256 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/256 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/264 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/264 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 80/344 variables, 46/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/344 variables, 14/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/344 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/348 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 8/356 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/356 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 78/434 variables, 46/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/434 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/434 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 4/438 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/438 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/438 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 8/446 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/446 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 69/515 variables, 42/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/515 variables, 13/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/515 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/515 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 3/518 variables, 3/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/518 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/518 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 6/524 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/524 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/524 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 45/569 variables, 25/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/569 variables, 9/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/569 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/569 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 2/571 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/571 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/571 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 4/575 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/575 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 40/615 variables, 23/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/615 variables, 7/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/615 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 2/617 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/617 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/617 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 4/621 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/621 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 39/660 variables, 23/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/660 variables, 7/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/660 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 2/662 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/662 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/662 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 4/666 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/666 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 35/701 variables, 20/547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/701 variables, 6/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/701 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 2/703 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/703 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/703 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 4/707 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/707 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 34/741 variables, 21/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/741 variables, 8/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/741 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 26/767 variables, 14/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/767 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/767 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 2/769 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/769 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/769 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 4/773 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/773 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 21/794 variables, 15/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/794 variables, 5/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/794 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 19/813 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/813 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/813 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 2/815 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/815 variables, 2/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/815 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/819 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/819 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 21/840 variables, 15/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/840 variables, 5/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/840 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 19/859 variables, 8/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/859 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/859 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 2/861 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/861 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/861 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 4/865 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/865 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 22/887 variables, 15/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/887 variables, 5/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/887 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 16/903 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/903 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/903 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 2/905 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/905 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/905 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 4/909 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/909 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (OVERLAPS) 10/919 variables, 10/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/919 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/919 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (OVERLAPS) 0/919 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 919/919 variables, and 734 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 501/501 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/65 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 65/130 variables, 65/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 48/178 variables, 26/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/180 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/180 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/184 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/184 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 64/248 variables, 30/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/248 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/248 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 8/256 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/256 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/256 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 8/264 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/264 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/264 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/264 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 80/344 variables, 46/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/344 variables, 14/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/344 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 4/348 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/348 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/348 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 8/356 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/356 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 78/434 variables, 46/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/434 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/434 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 4/438 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/438 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/438 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 8/446 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/446 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/446 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 69/515 variables, 42/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/515 variables, 13/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/515 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/515 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 3/518 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/518 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/518 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 6/524 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/524 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/524 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/524 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/524 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 45/569 variables, 25/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/569 variables, 9/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/569 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/569 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 2/571 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/571 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/571 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/575 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/575 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 40/615 variables, 23/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/615 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/615 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 2/617 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/617 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/617 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 4/621 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/621 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 39/660 variables, 23/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/660 variables, 7/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/660 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 2/662 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/662 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/662 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 4/666 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/666 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 35/701 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/701 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:27] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:48:27] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/701 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/701 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 2/703 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/703 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/703 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 4/707 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/707 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 34/741 variables, 21/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/741 variables, 8/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/741 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 26/767 variables, 14/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/767 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/767 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 2/769 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/769 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/769 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/773 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/773 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 21/794 variables, 15/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/794 variables, 5/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/794 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 19/813 variables, 8/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/813 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:27] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 111 (INCLUDED_ONLY) 0/813 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:27] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
At refinement iteration 112 (INCLUDED_ONLY) 0/813 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/813 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 2/815 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/815 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/815 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 4/819 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/819 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 21/840 variables, 15/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/840 variables, 5/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:27] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
At refinement iteration 121 (INCLUDED_ONLY) 0/840 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/840 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 19/859 variables, 8/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/859 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/859 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 2/861 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/861 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/861 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 4/865 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:48:28] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
At refinement iteration 130 (INCLUDED_ONLY) 0/865 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/865 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (OVERLAPS) 22/887 variables, 15/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/887 variables, 5/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/887 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 16/903 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/903 variables, 2/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/903 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (OVERLAPS) 2/905 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/905 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/905 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (OVERLAPS) 4/909 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/909 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 10/919 variables, 10/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/919 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/919 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (OVERLAPS) 0/919 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 919/919 variables, and 752 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2473 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 501/501 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 3642ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 547 ms.
Support contains 5 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 501/501 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-05-29 19:48:28] [INFO ] Invariant cache hit.
[2024-05-29 19:48:29] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-29 19:48:29] [INFO ] Invariant cache hit.
[2024-05-29 19:48:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-29 19:48:29] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-05-29 19:48:29] [INFO ] Redundant transitions in 21 ms returned []
Running 411 sub problems to find dead transitions.
[2024-05-29 19:48:29] [INFO ] Invariant cache hit.
[2024-05-29 19:48:29] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-29 19:48:32] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:48:35] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:48:35] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-29 19:48:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:48:36] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:48:36] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:48:36] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:48:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 5/501 variables, 26/245 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:48:45] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:45] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:48:45] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-29 19:48:48] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:48:48] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:48:48] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-29 19:48:54] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:48:54] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (OVERLAPS) 418/919 variables, 501/758 constraints. Problems are: Problem set: 0 solved, 411 unsolved
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 30080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30791 ms. Remains : 501/501 places, 418/418 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 0 with 111 rules applied. Total rules applied 111 place count 501 transition count 418
Applied a total of 111 rules in 17 ms. Remains 501 /501 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 418 rows 501 cols
[2024-05-29 19:48:59] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 19:48:59] [INFO ] [Real]Absence check using 218 positive place invariants in 26 ms returned sat
[2024-05-29 19:48:59] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 19:48:59] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-29 19:49:00] [INFO ] After 40ms SMT Verify possible using 98 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 19:49:00] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 19:49:00] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2024-05-29 19:49:00] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 19:49:00] [INFO ] After 82ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
TRAPS : Iteration 1
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 2
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
TRAPS : Iteration 3
[2024-05-29 19:49:01] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-29 19:49:01] [INFO ] After 1229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1590 ms.
[2024-05-29 19:49:01] [INFO ] Flatten gal took : 42 ms
[2024-05-29 19:49:01] [INFO ] Flatten gal took : 42 ms
[2024-05-29 19:49:01] [INFO ] Input system was already deterministic with 1228 transitions.
Computed a total of 322 stabilizing places and 322 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1341 transition count 1201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1341 transition count 1201
Applied a total of 54 rules in 78 ms. Remains 1341 /1368 variables (removed 27) and now considering 1201/1228 (removed 27) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 19:49:01] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 19:49:01] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-29 19:49:01] [INFO ] Invariant cache hit.
[2024-05-29 19:49:02] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-29 19:49:02] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30214ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1368 places, 1201/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31457 ms. Remains : 1341/1368 places, 1201/1228 transitions.
[2024-05-29 19:49:32] [INFO ] Flatten gal took : 48 ms
[2024-05-29 19:49:33] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:49:33] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-29 19:49:33] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:49:33] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:49:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13284518982857085371.gal : 18 ms
[2024-05-29 19:49:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8664913899375223979.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13284518982857085371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8664913899375223979.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 19:50:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:50:03] [INFO ] Applying decomposition
[2024-05-29 19:50:03] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1351311929652376101.txt' '-o' '/tmp/graph1351311929652376101.bin' '-w' '/tmp/graph1351311929652376101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1351311929652376101.bin' '-l' '-1' '-v' '-w' '/tmp/graph1351311929652376101.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:50:03] [INFO ] Decomposing Gal with order
[2024-05-29 19:50:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:50:03] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-29 19:50:03] [INFO ] Flatten gal took : 108 ms
[2024-05-29 19:50:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 19:50:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12536916723737523401.gal : 17 ms
[2024-05-29 19:50:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15707137937780402484.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12536916723737523401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15707137937780402484.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 1368/1368 places, 1228/1228 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1342 transition count 1202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1342 transition count 1202
Applied a total of 52 rules in 87 ms. Remains 1342 /1368 variables (removed 26) and now considering 1202/1228 (removed 26) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2024-05-29 19:50:34] [INFO ] Computed 221 invariants in 16 ms
[2024-05-29 19:50:34] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-29 19:50:34] [INFO ] Invariant cache hit.
[2024-05-29 19:50:35] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2024-05-29 19:50:35] [INFO ] Invariant cache hit.
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 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 30207ms
Starting structural reductions in LTL mode, iteration 1 : 1342/1368 places, 1202/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31624 ms. Remains : 1342/1368 places, 1202/1228 transitions.
[2024-05-29 19:51:05] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:51:05] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:51:05] [INFO ] Input system was already deterministic with 1202 transitions.
[2024-05-29 19:51:05] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:51:05] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:51:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4009138227227957580.gal : 5 ms
[2024-05-29 19:51:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2908974076985440626.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4009138227227957580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2908974076985440626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 19:51:35] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:51:35] [INFO ] Applying decomposition
[2024-05-29 19:51:35] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5411179845243988965.txt' '-o' '/tmp/graph5411179845243988965.bin' '-w' '/tmp/graph5411179845243988965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5411179845243988965.bin' '-l' '-1' '-v' '-w' '/tmp/graph5411179845243988965.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:51:35] [INFO ] Decomposing Gal with order
[2024-05-29 19:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:51:36] [INFO ] Removed a total of 204 redundant transitions.
[2024-05-29 19:51:36] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:51:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 19:51:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12696676151749018190.gal : 10 ms
[2024-05-29 19:51:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14526620988897874006.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12696676151749018190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14526620988897874006.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1367 transition count 950
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 1090 transition count 949
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 1089 transition count 949
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 556 place count 1089 transition count 800
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 854 place count 940 transition count 800
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 870 place count 924 transition count 784
Iterating global reduction 3 with 16 rules applied. Total rules applied 886 place count 924 transition count 784
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 886 place count 924 transition count 771
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 912 place count 911 transition count 771
Performed 326 Post agglomeration using F-continuation condition.Transition count delta: 326
Deduced a syphon composed of 326 places in 1 ms
Reduce places removed 326 places and 0 transitions.
Iterating global reduction 3 with 652 rules applied. Total rules applied 1564 place count 585 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1565 place count 585 transition count 444
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 1567 place count 584 transition count 443
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1569 place count 582 transition count 441
Applied a total of 1569 rules in 157 ms. Remains 582 /1368 variables (removed 786) and now considering 441/1228 (removed 787) transitions.
// Phase 1: matrix 441 rows 582 cols
[2024-05-29 19:52:06] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 19:52:06] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 19:52:06] [INFO ] Invariant cache hit.
[2024-05-29 19:52:06] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-29 19:52:06] [INFO ] Redundant transitions in 6 ms returned []
Running 439 sub problems to find dead transitions.
[2024-05-29 19:52:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 2/582 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 441/1023 variables, 582/803 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1023 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 803 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 2/582 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 441/1023 variables, 582/803 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 439/1242 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1023 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 1242 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in SI_CTL mode, iteration 1 : 582/1368 places, 441/1228 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60886 ms. Remains : 582/1368 places, 441/1228 transitions.
[2024-05-29 19:53:07] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:53:07] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:53:07] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-29 19:53:07] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:53:07] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:53:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8954425228796107361.gal : 3 ms
[2024-05-29 19:53:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14985156396440550581.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8954425228796107361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14985156396440550581.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.54922e+86,1.40517,55152,2,1062,5,203873,6,0,2772,349057,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(((p288==1) + A((p303==1) U (p1526==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((p288==1) + !((E(!((p1526==1)) U (!((p303==1)) * !((p1526==1)))) + EG(!((p1526...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 439/0/2
Hit Full ! (commute/partial/dont) 439/0/2
Detected timeout of ITS tools.
[2024-05-29 19:53:37] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:53:37] [INFO ] Applying decomposition
[2024-05-29 19:53:37] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14293514001018149834.txt' '-o' '/tmp/graph14293514001018149834.bin' '-w' '/tmp/graph14293514001018149834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14293514001018149834.bin' '-l' '-1' '-v' '-w' '/tmp/graph14293514001018149834.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:53:37] [INFO ] Decomposing Gal with order
[2024-05-29 19:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:53:37] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-29 19:53:37] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-29 19:53:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12317306041344365185.gal : 5 ms
[2024-05-29 19:53:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15311811527658038977.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12317306041344365185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15311811527658038977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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.54922e+86,4.9823,167540,98,15,319287,144,650,850415,48,882,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(((i6.i0.u29.p288==1) + A((i4.i1.u30.p303==1) U (i22.i3.u159.p1526==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((i6.i0.u29.p288==1) + !((E(!((i22.i3.u159.p1526==1)) U (!((i4.i1.u30.p303==1))...237
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1343 transition count 1203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1343 transition count 1203
Applied a total of 50 rules in 85 ms. Remains 1343 /1368 variables (removed 25) and now considering 1203/1228 (removed 25) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 19:54:07] [INFO ] Computed 221 invariants in 13 ms
[2024-05-29 19:54:07] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-29 19:54:07] [INFO ] Invariant cache hit.
[2024-05-29 19:54:08] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-29 19:54:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30198ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1368 places, 1203/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31500 ms. Remains : 1343/1368 places, 1203/1228 transitions.
[2024-05-29 19:54:38] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:54:38] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:54:39] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-29 19:54:39] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:54:39] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:54:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11069854513471319691.gal : 5 ms
[2024-05-29 19:54:39] [INFO ] Time to serialize properties into /tmp/CTLFireability165880761659553962.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11069854513471319691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability165880761659553962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 19:55:09] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:55:09] [INFO ] Applying decomposition
[2024-05-29 19:55:09] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph184514618812577914.txt' '-o' '/tmp/graph184514618812577914.bin' '-w' '/tmp/graph184514618812577914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph184514618812577914.bin' '-l' '-1' '-v' '-w' '/tmp/graph184514618812577914.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:55:09] [INFO ] Decomposing Gal with order
[2024-05-29 19:55:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:55:09] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-29 19:55:09] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:55:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 19:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15278209221548694476.gal : 11 ms
[2024-05-29 19:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10911649053913663163.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15278209221548694476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10911649053913663163.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1367 transition count 951
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 552 place count 1091 transition count 951
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 552 place count 1091 transition count 802
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 850 place count 942 transition count 802
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 867 place count 925 transition count 785
Iterating global reduction 2 with 17 rules applied. Total rules applied 884 place count 925 transition count 785
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 884 place count 925 transition count 771
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 912 place count 911 transition count 771
Performed 323 Post agglomeration using F-continuation condition.Transition count delta: 323
Deduced a syphon composed of 323 places in 0 ms
Reduce places removed 323 places and 0 transitions.
Iterating global reduction 2 with 646 rules applied. Total rules applied 1558 place count 588 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1559 place count 588 transition count 447
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 1561 place count 587 transition count 446
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1563 place count 585 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1564 place count 584 transition count 444
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1564 place count 584 transition count 442
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1568 place count 582 transition count 442
Applied a total of 1568 rules in 146 ms. Remains 582 /1368 variables (removed 786) and now considering 442/1228 (removed 786) transitions.
// Phase 1: matrix 442 rows 582 cols
[2024-05-29 19:55:39] [INFO ] Computed 220 invariants in 4 ms
[2024-05-29 19:55:39] [INFO ] Implicit Places using invariants in 234 ms returned [562, 566]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 580/1368 places, 442/1228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 578 transition count 440
Applied a total of 4 rules in 19 ms. Remains 578 /580 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 578 cols
[2024-05-29 19:55:39] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 19:55:40] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-29 19:55:40] [INFO ] Invariant cache hit.
[2024-05-29 19:55:40] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 578/1368 places, 440/1228 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1024 ms. Remains : 578/1368 places, 440/1228 transitions.
[2024-05-29 19:55:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:55:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:55:40] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-29 19:55:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:55:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:55:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12231227054470307657.gal : 2 ms
[2024-05-29 19:55:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16927329308469485238.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12231227054470307657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16927329308469485238.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.62555e+85,1.8784,65912,2,1233,5,246577,6,0,2754,423437,0


Converting to forward existential form...Done !
original formula: EG(((p612==0) + EF(((EG((p57==0)) + (p618==0)) + !(A((p479==1) U (p336==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((p612==0) + E(TRUE U ((EG((p57==0)) + (p618==0)) + !(!((E(!((p336==1)) U (!((p479==1)) * !((p336==1)...194
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t16, t62, t102, t104, t108, t112, t116, t11...342
Detected timeout of ITS tools.
[2024-05-29 19:56:10] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:56:10] [INFO ] Applying decomposition
[2024-05-29 19:56:10] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5405944577137222180.txt' '-o' '/tmp/graph5405944577137222180.bin' '-w' '/tmp/graph5405944577137222180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5405944577137222180.bin' '-l' '-1' '-v' '-w' '/tmp/graph5405944577137222180.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:56:10] [INFO ] Decomposing Gal with order
[2024-05-29 19:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:56:10] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-29 19:56:10] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-29 19:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16473625389214649128.gal : 3 ms
[2024-05-29 19:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9992964437160743273.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16473625389214649128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9992964437160743273.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.62555e+85,6.21627,229692,195,24,459840,218,624,1.40378e+06,49,1044,0


Converting to forward existential form...Done !
original formula: EG(((i6.u64.p612==0) + EF(((EG((i0.u5.p57==0)) + (i7.u65.p618==0)) + !(A((i5.u50.p479==1) U (i4.u33.p336==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((i6.u64.p612==0) + E(TRUE U ((EG((i0.u5.p57==0)) + (i7.u65.p618==0)) + !(!((E(!((i4.u33.p336==1)) U ...242
Reverse transition relation is NOT exact ! Due to transitions i0.u7.t104, i0.u8.t108, i0.u2.t0, i0.u6.t102, i0.u4.t2, i0.u15.t118, i0.u3.t1, i0.u5.t62, i1....617
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1348 transition count 1208
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1348 transition count 1208
Applied a total of 40 rules in 83 ms. Remains 1348 /1368 variables (removed 20) and now considering 1208/1228 (removed 20) transitions.
// Phase 1: matrix 1208 rows 1348 cols
[2024-05-29 19:56:40] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 19:56:41] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-29 19:56:41] [INFO ] Invariant cache hit.
[2024-05-29 19:56:42] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
Running 1207 sub problems to find dead transitions.
[2024-05-29 19:56:42] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
SMT process timed out in 30176ms, After SMT, problems are : Problem set: 0 solved, 1207 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Starting structural reductions in LTL mode, iteration 1 : 1348/1368 places, 1208/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31527 ms. Remains : 1348/1368 places, 1208/1228 transitions.
[2024-05-29 19:57:12] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:57:12] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:57:12] [INFO ] Input system was already deterministic with 1208 transitions.
[2024-05-29 19:57:12] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:57:12] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:57:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8363102139525329866.gal : 4 ms
[2024-05-29 19:57:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8902530400352700747.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8363102139525329866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8902530400352700747.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 19:57:42] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:57:42] [INFO ] Applying decomposition
[2024-05-29 19:57:42] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph13334684603384406878.txt' '-o' '/tmp/graph13334684603384406878.bin' '-w' '/tmp/graph13334684603384406878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13334684603384406878.bin' '-l' '-1' '-v' '-w' '/tmp/graph13334684603384406878.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:57:42] [INFO ] Decomposing Gal with order
[2024-05-29 19:57:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:57:42] [INFO ] Removed a total of 196 redundant transitions.
[2024-05-29 19:57:42] [INFO ] Flatten gal took : 42 ms
[2024-05-29 19:57:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 19:57:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6208635307638763361.gal : 11 ms
[2024-05-29 19:57:42] [INFO ] Time to serialize properties into /tmp/CTLFireability508581658122308114.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6208635307638763361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability508581658122308114.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1343 transition count 1203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1343 transition count 1203
Applied a total of 50 rules in 81 ms. Remains 1343 /1368 variables (removed 25) and now considering 1203/1228 (removed 25) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 19:58:12] [INFO ] Computed 221 invariants in 10 ms
[2024-05-29 19:58:13] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-29 19:58:13] [INFO ] Invariant cache hit.
[2024-05-29 19:58:14] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-29 19:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30190ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1368 places, 1203/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31539 ms. Remains : 1343/1368 places, 1203/1228 transitions.
[2024-05-29 19:58:44] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:58:44] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:58:44] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-29 19:58:44] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:58:44] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:58:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11680102087104848826.gal : 4 ms
[2024-05-29 19:58:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9426612695946834677.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11680102087104848826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9426612695946834677.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 19:59:14] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:59:14] [INFO ] Applying decomposition
[2024-05-29 19:59:14] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8560692747168143160.txt' '-o' '/tmp/graph8560692747168143160.bin' '-w' '/tmp/graph8560692747168143160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8560692747168143160.bin' '-l' '-1' '-v' '-w' '/tmp/graph8560692747168143160.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:59:14] [INFO ] Decomposing Gal with order
[2024-05-29 19:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:59:14] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-29 19:59:14] [INFO ] Flatten gal took : 39 ms
[2024-05-29 19:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:59:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7026232716805524633.gal : 9 ms
[2024-05-29 19:59:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16278787125884715958.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7026232716805524633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16278787125884715958.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 SI_CTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1367 transition count 951
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 552 place count 1091 transition count 951
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 552 place count 1091 transition count 802
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 850 place count 942 transition count 802
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 865 place count 927 transition count 787
Iterating global reduction 2 with 15 rules applied. Total rules applied 880 place count 927 transition count 787
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 880 place count 927 transition count 775
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 904 place count 915 transition count 775
Performed 326 Post agglomeration using F-continuation condition.Transition count delta: 326
Deduced a syphon composed of 326 places in 0 ms
Reduce places removed 326 places and 0 transitions.
Iterating global reduction 2 with 652 rules applied. Total rules applied 1556 place count 589 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 589 transition count 448
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 1559 place count 588 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1561 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1562 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1562 place count 585 transition count 443
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1566 place count 583 transition count 443
Applied a total of 1566 rules in 127 ms. Remains 583 /1368 variables (removed 785) and now considering 443/1228 (removed 785) transitions.
// Phase 1: matrix 443 rows 583 cols
[2024-05-29 19:59:45] [INFO ] Computed 220 invariants in 4 ms
[2024-05-29 19:59:45] [INFO ] Implicit Places using invariants in 260 ms returned [563, 567]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 581/1368 places, 443/1228 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 579 transition count 441
Applied a total of 4 rules in 25 ms. Remains 579 /581 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 579 cols
[2024-05-29 19:59:45] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 19:59:45] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-29 19:59:45] [INFO ] Invariant cache hit.
[2024-05-29 19:59:45] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 579/1368 places, 441/1228 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1035 ms. Remains : 579/1368 places, 441/1228 transitions.
[2024-05-29 19:59:45] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:59:45] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:59:45] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-29 19:59:46] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:59:46] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:59:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6401756202085511308.gal : 1 ms
[2024-05-29 19:59:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17106880822889250580.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6401756202085511308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17106880822889250580.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,6.26495e+85,1.47869,57568,2,1055,5,211909,6,0,2760,364771,0


Converting to forward existential form...Done !
original formula: A(E(EG((E((p1212==1) U (p1394==1)) * ((p903==1)||((p1121==1)&&(p273==1))))) U (p42!=1)) U ((p572==1)&&(p613==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p572==1)&&(p613==1)))))) * !(E(!(((p572==1)&&(p613==1))) U (!(E(EG((E((p1212==1) U (p1394==1)...252
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 439/0/2
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-29 20:00:16] [INFO ] Flatten gal took : 18 ms
[2024-05-29 20:00:16] [INFO ] Applying decomposition
[2024-05-29 20:00:16] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7885410246738038268.txt' '-o' '/tmp/graph7885410246738038268.bin' '-w' '/tmp/graph7885410246738038268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7885410246738038268.bin' '-l' '-1' '-v' '-w' '/tmp/graph7885410246738038268.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:00:16] [INFO ] Decomposing Gal with order
[2024-05-29 20:00:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:00:16] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-29 20:00:16] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:00:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-29 20:00:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3288980410302401950.gal : 3 ms
[2024-05-29 20:00:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17572459878182379329.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3288980410302401950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17572459878182379329.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,6.26495e+85,5.83048,191560,130,24,317015,242,723,1.20264e+06,66,1635,0


Converting to forward existential form...Done !
original formula: A(E(EG((E((i15.u126.p1212==1) U (i20.u144.p1394==1)) * ((i11.u93.p903==1)||((i16.u116.p1121==1)&&(i4.u27.p273==1))))) U (i0.u3.p42!=1)) U...205
=> equivalent forward existential formula: [((Init * !(EG(!(((i8.i0.i1.u57.p572==1)&&(i8.i1.i1.u62.p613==1)))))) * !(E(!(((i8.i0.i1.u57.p572==1)&&(i8.i1.i1...378
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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1367 transition count 950
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 1090 transition count 950
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 554 place count 1090 transition count 799
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 856 place count 939 transition count 799
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 873 place count 922 transition count 782
Iterating global reduction 2 with 17 rules applied. Total rules applied 890 place count 922 transition count 782
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 890 place count 922 transition count 768
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 918 place count 908 transition count 768
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 321
Deduced a syphon composed of 321 places in 0 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1560 place count 587 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1561 place count 587 transition count 446
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 3 with 2 rules applied. Total rules applied 1563 place count 586 transition count 445
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1565 place count 584 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1566 place count 583 transition count 443
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1566 place count 583 transition count 441
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1570 place count 581 transition count 441
Applied a total of 1570 rules in 130 ms. Remains 581 /1368 variables (removed 787) and now considering 441/1228 (removed 787) transitions.
// Phase 1: matrix 441 rows 581 cols
[2024-05-29 20:00:46] [INFO ] Computed 220 invariants in 8 ms
[2024-05-29 20:00:46] [INFO ] Implicit Places using invariants in 250 ms returned [561, 565]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 251 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 579/1368 places, 441/1228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 577 transition count 439
Applied a total of 4 rules in 16 ms. Remains 577 /579 variables (removed 2) and now considering 439/441 (removed 2) transitions.
// Phase 1: matrix 439 rows 577 cols
[2024-05-29 20:00:46] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 20:00:46] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-29 20:00:46] [INFO ] Invariant cache hit.
[2024-05-29 20:00:47] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 577/1368 places, 439/1228 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1019 ms. Remains : 577/1368 places, 439/1228 transitions.
[2024-05-29 20:00:47] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:00:47] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:00:47] [INFO ] Input system was already deterministic with 439 transitions.
[2024-05-29 20:00:47] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:00:47] [INFO ] Flatten gal took : 22 ms
[2024-05-29 20:00:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1374821956397692833.gal : 2 ms
[2024-05-29 20:00:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10717893487548123781.prop : 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1374821956397692833.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10717893487548123781.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10717893487548123781.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 209
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :209 after 384
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :384 after 2779
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2779 after 2.75197e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.75197e+06 after 1.71235e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.71235e+08 after 1.32631e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.32631e+13 after 5.19902e+28
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.19902e+28 after 3.15943e+51
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.34528e+85,2.11221,69624,2,1540,17,261371,7,0,2752,448157,0
Total reachable state count : 2.345279325855244804947710368096373088321e+85

Verifying 1 reachability properties.
Reachability property ShieldPPPt-PT-020B-CTLFireability-2024-08 does not hold.
FORMULA ShieldPPPt-PT-020B-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
No reachable states exhibit your property : ShieldPPPt-PT-020B-CTLFireability-2024-08

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-020B-CTLFireability-2024-08,0,2.11366,69624,1,0,17,261371,7,0,2754,448157,0
Interrupted probabilistic random walk after 456059 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 456059 steps, saw 346448 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1343 transition count 1203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1343 transition count 1203
Applied a total of 50 rules in 92 ms. Remains 1343 /1368 variables (removed 25) and now considering 1203/1228 (removed 25) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 20:00:50] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 20:00:50] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-29 20:00:50] [INFO ] Invariant cache hit.
[2024-05-29 20:00:51] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-29 20:00:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30197ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1368 places, 1203/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31541 ms. Remains : 1343/1368 places, 1203/1228 transitions.
[2024-05-29 20:01:21] [INFO ] Flatten gal took : 20 ms
[2024-05-29 20:01:22] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:01:22] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-29 20:01:22] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:01:22] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:01:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2842456883118092686.gal : 3 ms
[2024-05-29 20:01:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14880864203316074812.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2842456883118092686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14880864203316074812.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 20:01:52] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:01:52] [INFO ] Applying decomposition
[2024-05-29 20:01:52] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16999746634497593092.txt' '-o' '/tmp/graph16999746634497593092.bin' '-w' '/tmp/graph16999746634497593092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16999746634497593092.bin' '-l' '-1' '-v' '-w' '/tmp/graph16999746634497593092.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:01:52] [INFO ] Decomposing Gal with order
[2024-05-29 20:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:01:52] [INFO ] Removed a total of 199 redundant transitions.
[2024-05-29 20:01:52] [INFO ] Flatten gal took : 43 ms
[2024-05-29 20:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 20:01:52] [INFO ] Time to serialize gal into /tmp/CTLFireability78824975851143744.gal : 73 ms
[2024-05-29 20:01:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8341384346435784796.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability78824975851143744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8341384346435784796.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1343 transition count 1203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1343 transition count 1203
Applied a total of 50 rules in 86 ms. Remains 1343 /1368 variables (removed 25) and now considering 1203/1228 (removed 25) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 20:02:22] [INFO ] Computed 221 invariants in 9 ms
[2024-05-29 20:02:22] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-29 20:02:22] [INFO ] Invariant cache hit.
[2024-05-29 20:02:23] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-29 20:02:23] [INFO ] Invariant cache hit.
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 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1368 places, 1203/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31486 ms. Remains : 1343/1368 places, 1203/1228 transitions.
[2024-05-29 20:02:54] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:02:54] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:02:54] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-29 20:02:54] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:02:54] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:02:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15122540234767601568.gal : 4 ms
[2024-05-29 20:02:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10816295307875137165.ctl : 5 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15122540234767601568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10816295307875137165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 20:03:24] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:03:24] [INFO ] Applying decomposition
[2024-05-29 20:03:24] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6040956161327410126.txt' '-o' '/tmp/graph6040956161327410126.bin' '-w' '/tmp/graph6040956161327410126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6040956161327410126.bin' '-l' '-1' '-v' '-w' '/tmp/graph6040956161327410126.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:03:24] [INFO ] Decomposing Gal with order
[2024-05-29 20:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:03:24] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-29 20:03:24] [INFO ] Flatten gal took : 43 ms
[2024-05-29 20:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 20:03:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14421584644068452867.gal : 8 ms
[2024-05-29 20:03:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7311672098794588484.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14421584644068452867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7311672098794588484.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 1368/1368 places, 1228/1228 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1342 transition count 1202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1342 transition count 1202
Applied a total of 52 rules in 76 ms. Remains 1342 /1368 variables (removed 26) and now considering 1202/1228 (removed 26) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2024-05-29 20:03:54] [INFO ] Computed 221 invariants in 12 ms
[2024-05-29 20:03:54] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-29 20:03:54] [INFO ] Invariant cache hit.
[2024-05-29 20:03:55] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2024-05-29 20:03:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Starting structural reductions in LTL mode, iteration 1 : 1342/1368 places, 1202/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31558 ms. Remains : 1342/1368 places, 1202/1228 transitions.
[2024-05-29 20:04:26] [INFO ] Flatten gal took : 22 ms
[2024-05-29 20:04:26] [INFO ] Flatten gal took : 22 ms
[2024-05-29 20:04:26] [INFO ] Input system was already deterministic with 1202 transitions.
[2024-05-29 20:04:26] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:04:26] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:04:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3199664661615757675.gal : 4 ms
[2024-05-29 20:04:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9847095048193258646.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3199664661615757675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9847095048193258646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 20:04:56] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:04:56] [INFO ] Applying decomposition
[2024-05-29 20:04:56] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14273263183733758054.txt' '-o' '/tmp/graph14273263183733758054.bin' '-w' '/tmp/graph14273263183733758054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14273263183733758054.bin' '-l' '-1' '-v' '-w' '/tmp/graph14273263183733758054.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:04:56] [INFO ] Decomposing Gal with order
[2024-05-29 20:04:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:04:56] [INFO ] Removed a total of 198 redundant transitions.
[2024-05-29 20:04:56] [INFO ] Flatten gal took : 37 ms
[2024-05-29 20:04:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 20:04:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12347608612864148238.gal : 8 ms
[2024-05-29 20:04:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4458642221440752175.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12347608612864148238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4458642221440752175.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 SI_CTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1367 transition count 952
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1092 transition count 949
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1089 transition count 949
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 556 place count 1089 transition count 799
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 856 place count 939 transition count 799
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 871 place count 924 transition count 784
Iterating global reduction 3 with 15 rules applied. Total rules applied 886 place count 924 transition count 784
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 886 place count 924 transition count 772
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 910 place count 912 transition count 772
Performed 324 Post agglomeration using F-continuation condition.Transition count delta: 324
Deduced a syphon composed of 324 places in 0 ms
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 3 with 648 rules applied. Total rules applied 1558 place count 588 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 588 transition count 447
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 1561 place count 587 transition count 446
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1563 place count 585 transition count 444
Applied a total of 1563 rules in 113 ms. Remains 585 /1368 variables (removed 783) and now considering 444/1228 (removed 784) transitions.
// Phase 1: matrix 444 rows 585 cols
[2024-05-29 20:05:26] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 20:05:26] [INFO ] Implicit Places using invariants in 234 ms returned [573]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 235 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 584/1368 places, 444/1228 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 584 transition count 442
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 582 transition count 442
Applied a total of 4 rules in 10 ms. Remains 582 /584 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 582 cols
[2024-05-29 20:05:26] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 20:05:27] [INFO ] Implicit Places using invariants in 229 ms returned [560, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 230 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 580/1368 places, 442/1228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 578 transition count 440
Applied a total of 4 rules in 15 ms. Remains 578 /580 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 578 cols
[2024-05-29 20:05:27] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 20:05:27] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-29 20:05:27] [INFO ] Invariant cache hit.
[2024-05-29 20:05:27] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 578/1368 places, 440/1228 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1230 ms. Remains : 578/1368 places, 440/1228 transitions.
[2024-05-29 20:05:27] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:05:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:05:27] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-29 20:05:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:05:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:05:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15074624296299559357.gal : 2 ms
[2024-05-29 20:05:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12630613079933212010.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15074624296299559357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12630613079933212010.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.263e+85,1.51372,56412,2,1658,5,208496,6,0,2754,358165,0


Converting to forward existential form...Done !
original formula: !(A(A((!(((p1354==1)&&(p1356==1))) * !(A((p446==1) U (p1540==1)))) U (EG((p980==1)) + (p1359!=1))) U (p1543==1)))
=> equivalent forward existential formula: (([(((FwdU((FwdU(Init,!((p1543==1))) * !((p1543==1))),!((EG((p980==1)) + (p1359!=1)))) * !((!(((p1354==1)&&(p135...426
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...923
Detected timeout of ITS tools.
[2024-05-29 20:05:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 20:05:57] [INFO ] Applying decomposition
[2024-05-29 20:05:57] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2023230463502199304.txt' '-o' '/tmp/graph2023230463502199304.bin' '-w' '/tmp/graph2023230463502199304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2023230463502199304.bin' '-l' '-1' '-v' '-w' '/tmp/graph2023230463502199304.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:05:57] [INFO ] Decomposing Gal with order
[2024-05-29 20:05:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:05:58] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-29 20:05:58] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-29 20:05:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8195824326517824488.gal : 2 ms
[2024-05-29 20:05:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6829837515396380648.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8195824326517824488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6829837515396380648.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.263e+85,4.45125,144008,239,26,256644,217,670,865717,53,1063,0


Converting to forward existential form...Done !
original formula: !(A(A((!(((i21.i1.i2.u139.p1354==1)&&(i21.i1.i2.u139.p1356==1))) * !(A((i4.u45.p446==1) U (i22.u160.p1540==1)))) U (EG((i14.u101.p980==1)...210
=> equivalent forward existential formula: (([(((FwdU((FwdU(Init,!((i22.u160.p1543==1))) * !((i22.u160.p1543==1))),!((EG((i14.u101.p980==1)) + (i21.i0.i1.u...607
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t1, i0.u7.t105, i0.u8.t109, i0.u4.t2, i0.u15.t119, i0.u2.t0, i0.u6.t103, i1.u14.t117, i...2145
Using saturation style SCC detection
Using saturation style SCC detection
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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1367 transition count 952
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 550 place count 1092 transition count 952
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 550 place count 1092 transition count 802
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 850 place count 942 transition count 802
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 866 place count 926 transition count 786
Iterating global reduction 2 with 16 rules applied. Total rules applied 882 place count 926 transition count 786
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 882 place count 926 transition count 772
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 910 place count 912 transition count 772
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 0 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 2 with 644 rules applied. Total rules applied 1554 place count 590 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 590 transition count 449
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 1557 place count 589 transition count 448
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1558 place count 589 transition count 448
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1560 place count 587 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1561 place count 586 transition count 446
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1561 place count 586 transition count 444
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1565 place count 584 transition count 444
Applied a total of 1565 rules in 122 ms. Remains 584 /1368 variables (removed 784) and now considering 444/1228 (removed 784) transitions.
// Phase 1: matrix 444 rows 584 cols
[2024-05-29 20:06:28] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 20:06:28] [INFO ] Implicit Places using invariants in 237 ms returned [564, 568]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 582/1368 places, 444/1228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 580 transition count 442
Applied a total of 4 rules in 15 ms. Remains 580 /582 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 580 cols
[2024-05-29 20:06:28] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 20:06:28] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-29 20:06:28] [INFO ] Invariant cache hit.
[2024-05-29 20:06:29] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 580/1368 places, 442/1228 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1012 ms. Remains : 580/1368 places, 442/1228 transitions.
[2024-05-29 20:06:29] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:06:29] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:06:29] [INFO ] Input system was already deterministic with 442 transitions.
[2024-05-29 20:06:29] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:06:29] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:06:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10202587862055161501.gal : 3 ms
[2024-05-29 20:06:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2609214831290345175.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10202587862055161501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2609214831290345175.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,3.42114e+85,2.69318,89428,2,1260,5,339106,6,0,2763,600831,0


Converting to forward existential form...Done !
original formula: AG(!(E(AF((((p1220==1)&&(p183==1))&&(((p123==1)&&(p175==1))||(p1146==1)))) U (p236==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(EG(!((((p1220==1)&&(p183==1))&&(((p123==1)&&(p175==1))||(p1146==1))))))) * (p236==1))] ...162
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t10, t45, t46, t49, t57, t60, t101, t104, t106, t110, t114, t118, t12...294
Detected timeout of ITS tools.
[2024-05-29 20:06:59] [INFO ] Flatten gal took : 18 ms
[2024-05-29 20:06:59] [INFO ] Applying decomposition
[2024-05-29 20:06:59] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5816358358548264473.txt' '-o' '/tmp/graph5816358358548264473.bin' '-w' '/tmp/graph5816358358548264473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5816358358548264473.bin' '-l' '-1' '-v' '-w' '/tmp/graph5816358358548264473.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:06:59] [INFO ] Decomposing Gal with order
[2024-05-29 20:06:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:06:59] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 20:06:59] [INFO ] Flatten gal took : 14 ms
[2024-05-29 20:06:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2024-05-29 20:06:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9476468210968804450.gal : 2 ms
[2024-05-29 20:06:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8266601514701509553.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9476468210968804450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8266601514701509553.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.42114e+85,23.1009,577080,211,29,940063,270,700,3.56689e+06,50,1271,0


Converting to forward existential form...Done !
original formula: AG(!(E(AF((((i16.u128.p1220==1)&&(i2.u18.p183==1))&&(((i0.u12.p123==1)&&(i0.u17.p175==1))||(i15.u121.p1146==1)))) U (i2.u26.p236==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(EG(!((((i16.u128.p1220==1)&&(i2.u18.p183==1))&&(((i0.u12.p123==1)&&(i0.u17.p175==1))||(...208
Reverse transition relation is NOT exact ! Due to transitions i0.u15.t118, i0.u17.t124, i0.u5.t101, i0.u11.t4, i0.u10.t3, i0.u14.t114, i1.u3.t1, i1.u8.t110...457
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 273 place count 1367 transition count 954
Reduce places removed 273 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 276 rules applied. Total rules applied 549 place count 1094 transition count 951
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 552 place count 1091 transition count 951
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 552 place count 1091 transition count 801
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 852 place count 941 transition count 801
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 869 place count 924 transition count 784
Iterating global reduction 3 with 17 rules applied. Total rules applied 886 place count 924 transition count 784
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 886 place count 924 transition count 771
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 912 place count 911 transition count 771
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 0 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1556 place count 589 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1557 place count 589 transition count 448
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 1559 place count 588 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1561 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1562 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1562 place count 585 transition count 443
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1566 place count 583 transition count 443
Applied a total of 1566 rules in 122 ms. Remains 583 /1368 variables (removed 785) and now considering 443/1228 (removed 785) transitions.
// Phase 1: matrix 443 rows 583 cols
[2024-05-29 20:07:29] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 20:07:29] [INFO ] Implicit Places using invariants in 236 ms returned [563, 567]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 237 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 581/1368 places, 443/1228 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 579 transition count 441
Applied a total of 4 rules in 15 ms. Remains 579 /581 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 579 cols
[2024-05-29 20:07:29] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 20:07:29] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-29 20:07:29] [INFO ] Invariant cache hit.
[2024-05-29 20:07:30] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 579/1368 places, 441/1228 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1003 ms. Remains : 579/1368 places, 441/1228 transitions.
[2024-05-29 20:07:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:07:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:07:30] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-29 20:07:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:07:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:07:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2855618399475169033.gal : 2 ms
[2024-05-29 20:07:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4830656547603165610.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2855618399475169033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4830656547603165610.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.71619e+85,2.15847,74584,2,1281,5,273680,6,0,2758,475764,0


Converting to forward existential form...Done !
original formula: EG((EF((((p1007==1)||(p375==1))&&(p327==0))) * (EG(((p738==0)||(p740==0))) + EG(((p111==0)||(p147==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((p1007==1)||(p375==1))&&(p327==0))) * (EG(((p738==0)||(p740==0))) + EG(((p111==0)||(p147=...173
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t58, t61, t98, t102, t104, t106, t110,...346
Detected timeout of ITS tools.
[2024-05-29 20:08:00] [INFO ] Flatten gal took : 16 ms
[2024-05-29 20:08:00] [INFO ] Applying decomposition
[2024-05-29 20:08:00] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8531210498222225266.txt' '-o' '/tmp/graph8531210498222225266.bin' '-w' '/tmp/graph8531210498222225266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8531210498222225266.bin' '-l' '-1' '-v' '-w' '/tmp/graph8531210498222225266.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:08:00] [INFO ] Decomposing Gal with order
[2024-05-29 20:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:08:00] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 20:08:00] [INFO ] Flatten gal took : 13 ms
[2024-05-29 20:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-29 20:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9810101309725092938.gal : 3 ms
[2024-05-29 20:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10044136457531707768.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9810101309725092938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10044136457531707768.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,3.71619e+85,10.008,306052,205,24,557782,220,640,1.9732e+06,48,1088,0


Converting to forward existential form...Done !
original formula: EG((EF((((i13.i1.i0.u105.p1007==1)||(i4.u40.p375==1))&&(i3.u34.p327==0))) * (EG(((i7.u77.p738==0)||(i7.u77.p740==0))) + EG(((i1.u10.p111=...181
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((i13.i1.i0.u105.p1007==1)||(i4.u40.p375==1))&&(i3.u34.p327==0))) * (EG(((i7.u77.p738==0)|...230
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t1, i0.u7.t106, i0.u4.t2, i0.u16.t121, i0.u2.t0, i0.u5.t102, i0.u6.t104, i0.u8.t110, i1...576
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1368/1368 places, 1228/1228 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1342 transition count 1202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1342 transition count 1202
Applied a total of 52 rules in 78 ms. Remains 1342 /1368 variables (removed 26) and now considering 1202/1228 (removed 26) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2024-05-29 20:08:30] [INFO ] Computed 221 invariants in 13 ms
[2024-05-29 20:08:31] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-29 20:08:31] [INFO ] Invariant cache hit.
[2024-05-29 20:08:31] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2024-05-29 20:08:31] [INFO ] Invariant cache hit.
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.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 30196ms
Starting structural reductions in LTL mode, iteration 1 : 1342/1368 places, 1202/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31540 ms. Remains : 1342/1368 places, 1202/1228 transitions.
[2024-05-29 20:09:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:09:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:09:02] [INFO ] Input system was already deterministic with 1202 transitions.
[2024-05-29 20:09:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:09:02] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:09:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12401620430182727230.gal : 4 ms
[2024-05-29 20:09:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1562881354345251284.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12401620430182727230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1562881354345251284.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-29 20:09:32] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:09:32] [INFO ] Applying decomposition
[2024-05-29 20:09:32] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph6387765661906938462.txt' '-o' '/tmp/graph6387765661906938462.bin' '-w' '/tmp/graph6387765661906938462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6387765661906938462.bin' '-l' '-1' '-v' '-w' '/tmp/graph6387765661906938462.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:09:32] [INFO ] Decomposing Gal with order
[2024-05-29 20:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:09:32] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 20:09:32] [INFO ] Flatten gal took : 36 ms
[2024-05-29 20:09:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 20:09:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9182423481885760535.gal : 8 ms
[2024-05-29 20:09:32] [INFO ] Time to serialize properties into /tmp/CTLFireability937931954924520325.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9182423481885760535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability937931954924520325.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 20:10:02] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:10:02] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:10:02] [INFO ] Applying decomposition
[2024-05-29 20:10:02] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph2822546534537406553.txt' '-o' '/tmp/graph2822546534537406553.bin' '-w' '/tmp/graph2822546534537406553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2822546534537406553.bin' '-l' '-1' '-v' '-w' '/tmp/graph2822546534537406553.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:10:02] [INFO ] Decomposing Gal with order
[2024-05-29 20:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:10:02] [INFO ] Removed a total of 186 redundant transitions.
[2024-05-29 20:10:02] [INFO ] Flatten gal took : 37 ms
[2024-05-29 20:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 20:10:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18190413777889267563.gal : 8 ms
[2024-05-29 20:10:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8178194693692319190.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18190413777889267563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8178194693692319190.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 20:17:15] [INFO ] Applying decomposition
[2024-05-29 20:17:15] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:17:15] [INFO ] Decomposing Gal with order
[2024-05-29 20:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:17:15] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-29 20:17:15] [INFO ] Flatten gal took : 35 ms
[2024-05-29 20:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 16 ms.
[2024-05-29 20:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15901518732268831459.gal : 9 ms
[2024-05-29 20:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5369117369530748436.ctl : 2 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15901518732268831459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5369117369530748436.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 20:24:03] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:24:03] [INFO ] Input system was already deterministic with 1228 transitions.
[2024-05-29 20:24:03] [INFO ] Transformed 1368 places.
[2024-05-29 20:24:03] [INFO ] Transformed 1228 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 20:24:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16748319725083284682.gal : 3 ms
[2024-05-29 20:24:04] [INFO ] Time to serialize properties into /tmp/CTLFireability747517778436235275.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16748319725083284682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability747517778436235275.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2785107 ms.

BK_STOP 1717014815533

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldPPPt-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-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-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 r356-tall-171683761500634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;