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.r528-tall-171683761500650.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 ltsminxred
Input is ShieldPPPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K 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 569K 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-030B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717258150195

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:09:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:09:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:09:11] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-06-01 16:09:11] [INFO ] Transformed 2343 places.
[2024-06-01 16:09:11] [INFO ] Transformed 2133 transitions.
[2024-06-01 16:09:11] [INFO ] Found NUPN structural information;
[2024-06-01 16:09:11] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 113 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 307 place count 2036 transition count 1826
Iterating global reduction 0 with 307 rules applied. Total rules applied 614 place count 2036 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 615 place count 2035 transition count 1825
Iterating global reduction 0 with 1 rules applied. Total rules applied 616 place count 2035 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 617 place count 2034 transition count 1824
Iterating global reduction 0 with 1 rules applied. Total rules applied 618 place count 2034 transition count 1824
Applied a total of 618 rules in 946 ms. Remains 2034 /2343 variables (removed 309) and now considering 1824/2133 (removed 309) transitions.
// Phase 1: matrix 1824 rows 2034 cols
[2024-06-01 16:09:12] [INFO ] Computed 331 invariants in 36 ms
[2024-06-01 16:09:13] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-06-01 16:09:13] [INFO ] Invariant cache hit.
[2024-06-01 16:09:15] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2548 ms to find 0 implicit places.
Running 1823 sub problems to find dead transitions.
[2024-06-01 16:09:15] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2033/3858 variables, and 0 constraints, problems are : Problem set: 0 solved, 1823 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 1823/1823 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1823 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2033/3858 variables, and 0 constraints, problems are : Problem set: 0 solved, 1823 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 0/1823 constraints, Known Traps: 0/0 constraints]
After SMT, in 60625ms problems are : Problem set: 0 solved, 1823 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Starting structural reductions in LTL mode, iteration 1 : 2034/2343 places, 1824/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64204 ms. Remains : 2034/2343 places, 1824/2133 transitions.
Support contains 113 out of 2034 places after structural reductions.
[2024-06-01 16:10:16] [INFO ] Flatten gal took : 136 ms
[2024-06-01 16:10:16] [INFO ] Flatten gal took : 78 ms
[2024-06-01 16:10:16] [INFO ] Input system was already deterministic with 1824 transitions.
Support contains 110 out of 2034 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2393 ms. (16 steps per ms) remains 40/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
[2024-06-01 16:10:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 503/563 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1471/2034 variables, 268/331 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2034 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1824/3858 variables, 2034/2365 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3858 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3858/3858 variables, and 2365 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2034/2034 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 503/563 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 12 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1471/2034 variables, 268/338 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 8 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 5 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 3 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:10:26] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:10:27] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2034/3858 variables, and 356 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 0/40 constraints, Known Traps: 25/25 constraints]
After SMT, in 10048ms problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 2034 transition count 1431
Reduce places removed 393 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 403 rules applied. Total rules applied 796 place count 1641 transition count 1421
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 806 place count 1631 transition count 1421
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 806 place count 1631 transition count 1205
Deduced a syphon composed of 216 places in 2 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1238 place count 1415 transition count 1205
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1245 place count 1408 transition count 1198
Iterating global reduction 3 with 7 rules applied. Total rules applied 1252 place count 1408 transition count 1198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1252 place count 1408 transition count 1193
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1262 place count 1403 transition count 1193
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 6 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2260 place count 904 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2261 place count 904 transition count 693
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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2263 place count 903 transition count 692
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 2423 place count 823 transition count 692
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2424 place count 823 transition count 691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2425 place count 822 transition count 691
Partial Free-agglomeration rule applied 87 times.
Drop transitions (Partial Free agglomeration) removed 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 2512 place count 822 transition count 691
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2513 place count 821 transition count 690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2514 place count 820 transition count 690
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2514 place count 820 transition count 688
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2518 place count 818 transition count 688
Applied a total of 2518 rules in 549 ms. Remains 818 /2034 variables (removed 1216) and now considering 688/1824 (removed 1136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 549 ms. Remains : 818/2034 places, 688/1824 transitions.
RANDOM walk for 40000 steps (8 resets) in 821 ms. (48 steps per ms) remains 28/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
// Phase 1: matrix 688 rows 818 cols
[2024-06-01 16:10:28] [INFO ] Computed 330 invariants in 3 ms
[2024-06-01 16:10:28] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 116/158 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 51/209 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 251/460 variables, 209/275 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 313/773 variables, 180/459 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 61/520 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/773 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 20/793 variables, 21/542 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/793 variables, 15/557 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/793 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 22/815 variables, 11/568 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/815 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (OVERLAPS) 250/1065 variables, 148/716 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1065 variables, 43/759 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1065 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1065 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 21 (OVERLAPS) 15/1080 variables, 16/776 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1080 variables, 15/791 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1080 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 24 (OVERLAPS) 23/1103 variables, 12/803 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1103 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1103 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 27 (OVERLAPS) 166/1269 variables, 112/916 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1269 variables, 36/952 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1269 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 30 (OVERLAPS) 4/1273 variables, 6/958 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1273 variables, 4/962 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1273 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 33 (OVERLAPS) 4/1277 variables, 2/964 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1277 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 35 (OVERLAPS) 78/1355 variables, 44/1008 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1355 variables, 13/1021 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1355 variables, 1/1022 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1355 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 39 (OVERLAPS) 7/1362 variables, 6/1028 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1362 variables, 5/1033 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1362 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 42 (OVERLAPS) 10/1372 variables, 5/1038 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1372 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 44 (OVERLAPS) 49/1421 variables, 35/1073 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1421 variables, 9/1082 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1421 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 47 (OVERLAPS) 2/1423 variables, 2/1084 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1423 variables, 2/1086 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1423 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 50 (OVERLAPS) 40/1463 variables, 19/1105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1463 variables, 5/1110 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1463 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 53 (OVERLAPS) 4/1467 variables, 4/1114 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1467 variables, 4/1118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1467 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 56 (OVERLAPS) 8/1475 variables, 4/1122 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1475 variables, 2/1124 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1475 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 59 (OVERLAPS) 25/1500 variables, 19/1143 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1500 variables, 6/1149 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1500 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 62 (OVERLAPS) 6/1506 variables, 4/1153 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1506 variables, 2/1155 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1506 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 65 (OVERLAPS) 0/1506 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 1155 constraints, problems are : Problem set: 0 solved, 28 unsolved in 11117 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 818/818 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 116/158 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 51/209 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 16:10:40] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 251/460 variables, 209/278 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 16:10:40] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:10:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 313/773 variables, 180/480 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/773 variables, 61/541 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/773 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/773 variables, 13/555 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:41] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:10:41] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:10:41] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:10:41] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/773 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/773 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/773 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 19 (OVERLAPS) 20/793 variables, 21/582 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/793 variables, 15/597 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/793 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 22 (OVERLAPS) 22/815 variables, 11/608 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/815 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 24 (OVERLAPS) 250/1065 variables, 148/756 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1065 variables, 43/799 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1065 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1065 variables, 2/802 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1065 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 29 (OVERLAPS) 15/1080 variables, 16/818 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1080 variables, 15/833 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1080 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 32 (OVERLAPS) 23/1103 variables, 12/845 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1103 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1103 variables, 2/848 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1103 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 36 (OVERLAPS) 166/1269 variables, 112/960 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1269 variables, 36/996 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1269 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 39 (OVERLAPS) 4/1273 variables, 6/1002 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1273 variables, 4/1006 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1273 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 42 (OVERLAPS) 4/1277 variables, 2/1008 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:49] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1277 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1277 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 45 (OVERLAPS) 78/1355 variables, 44/1053 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1355 variables, 13/1066 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1355 variables, 1/1067 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:51] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:10:51] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1355 variables, 2/1069 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1355 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 50 (OVERLAPS) 7/1362 variables, 6/1075 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1362 variables, 5/1080 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1362 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 53 (OVERLAPS) 10/1372 variables, 5/1085 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:53] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1372 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1372 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 56 (OVERLAPS) 49/1421 variables, 35/1121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1421 variables, 9/1130 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1421 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 59 (OVERLAPS) 2/1423 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1423 variables, 2/1134 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:10:56] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1423 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1423 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 63 (OVERLAPS) 40/1463 variables, 19/1154 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1463 variables, 5/1159 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1463 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 66 (OVERLAPS) 4/1467 variables, 4/1163 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1467 variables, 4/1167 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1467 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 69 (OVERLAPS) 8/1475 variables, 4/1171 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1475 variables, 2/1173 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1475 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 72 (OVERLAPS) 25/1500 variables, 19/1192 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1500 variables, 6/1198 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1500 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 75 (OVERLAPS) 6/1506 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1506 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 16:11:02] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/1506 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1506 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 79 (OVERLAPS) 0/1506 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 1205 constraints, problems are : Problem set: 0 solved, 28 unsolved in 24762 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 818/818 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 22/22 constraints]
After SMT, in 35902ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 21 different solutions.
Parikh walk visited 1 properties in 2469 ms.
Support contains 39 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 688/688 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 818 transition count 686
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 816 transition count 685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 815 transition count 685
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 6 place count 815 transition count 679
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 18 place count 809 transition count 679
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 36 place count 800 transition count 670
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 797 transition count 670
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 794 transition count 667
Applied a total of 45 rules in 101 ms. Remains 794 /818 variables (removed 24) and now considering 667/688 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 794/818 places, 667/688 transitions.
RANDOM walk for 40000 steps (8 resets) in 630 ms. (63 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 115137 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 26
Probabilistic random walk after 115137 steps, saw 85413 distinct states, run finished after 3004 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 667 rows 794 cols
[2024-06-01 16:11:10] [INFO ] Computed 330 invariants in 3 ms
[2024-06-01 16:11:10] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 83/120 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 29/149 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 188/337 variables, 149/196 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 279/616 variables, 157/359 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 53/412 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 15/631 variables, 18/431 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/631 variables, 15/446 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 22/653 variables, 11/457 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 231/884 variables, 134/591 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/884 variables, 42/633 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/884 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/884 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 21 (OVERLAPS) 13/897 variables, 13/647 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/897 variables, 11/658 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/897 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 24 (OVERLAPS) 21/918 variables, 11/669 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/918 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/918 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 27 (OVERLAPS) 175/1093 variables, 117/787 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1093 variables, 36/823 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1093 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 30 (OVERLAPS) 5/1098 variables, 8/831 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1098 variables, 5/836 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1098 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 33 (OVERLAPS) 4/1102 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1102 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 35 (OVERLAPS) 80/1182 variables, 44/882 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1182 variables, 15/897 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1182 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 38 (OVERLAPS) 4/1186 variables, 4/901 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1186 variables, 4/905 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1186 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 41 (OVERLAPS) 8/1194 variables, 4/909 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1194 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 43 (OVERLAPS) 96/1290 variables, 55/964 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1290 variables, 14/978 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1290 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 46 (OVERLAPS) 4/1294 variables, 8/986 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1294 variables, 4/990 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1294 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 49 (OVERLAPS) 68/1362 variables, 37/1027 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1362 variables, 14/1041 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1362 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 52 (OVERLAPS) 4/1366 variables, 4/1045 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1366 variables, 4/1049 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1366 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 55 (OVERLAPS) 8/1374 variables, 4/1053 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1374 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 57 (OVERLAPS) 68/1442 variables, 41/1094 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1442 variables, 8/1102 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1442 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 60 (OVERLAPS) 4/1446 variables, 8/1110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1446 variables, 4/1114 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1446 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 63 (OVERLAPS) 15/1461 variables, 12/1126 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1461 variables, 6/1132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1461 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 66 (OVERLAPS) 0/1461 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1461/1461 variables, and 1132 constraints, problems are : Problem set: 0 solved, 26 unsolved in 8931 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 794/794 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 83/120 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 29/149 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 188/337 variables, 149/198 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 13/217 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 279/616 variables, 157/375 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 53/428 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 13/442 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:11:21] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/616 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:21] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (OVERLAPS) 15/631 variables, 18/464 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/631 variables, 15/479 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 21 (OVERLAPS) 22/653 variables, 11/490 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/653 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 23 (OVERLAPS) 231/884 variables, 134/624 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/884 variables, 42/666 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/884 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/884 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/884 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 28 (OVERLAPS) 13/897 variables, 13/681 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/897 variables, 11/692 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/897 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 31 (OVERLAPS) 21/918 variables, 11/703 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/918 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/918 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 34 (OVERLAPS) 175/1093 variables, 117/821 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1093 variables, 36/857 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1093 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 37 (OVERLAPS) 5/1098 variables, 8/865 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1098 variables, 5/870 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:25] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:11:25] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1098 variables, 2/872 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:26] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1098 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1098 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 42 (OVERLAPS) 4/1102 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:27] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1102 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1102 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 45 (OVERLAPS) 80/1182 variables, 44/920 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1182 variables, 15/935 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1182 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 48 (OVERLAPS) 4/1186 variables, 4/939 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1186 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:29] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1186 variables, 1/944 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1186 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 52 (OVERLAPS) 8/1194 variables, 4/948 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1194 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1194 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 55 (OVERLAPS) 96/1290 variables, 55/1004 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1290 variables, 14/1018 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1290 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 58 (OVERLAPS) 4/1294 variables, 8/1026 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1294 variables, 4/1030 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:32] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1294 variables, 1/1031 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1294 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 62 (OVERLAPS) 68/1362 variables, 37/1068 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1362 variables, 14/1082 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1362 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 65 (OVERLAPS) 4/1366 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1366 variables, 4/1090 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1366 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 68 (OVERLAPS) 8/1374 variables, 4/1094 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1374 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 70 (OVERLAPS) 68/1442 variables, 41/1135 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1442 variables, 8/1143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1442 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 73 (OVERLAPS) 4/1446 variables, 8/1151 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1446 variables, 4/1155 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 16:11:37] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/1446 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1446 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 77 (OVERLAPS) 15/1461 variables, 12/1168 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1461 variables, 6/1174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1461 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 80 (OVERLAPS) 0/1461 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1461/1461 variables, and 1174 constraints, problems are : Problem set: 0 solved, 26 unsolved in 21031 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 794/794 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 16/16 constraints]
After SMT, in 29988ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1216 ms.
Support contains 37 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 667/667 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 794 transition count 666
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 793 transition count 666
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 792 transition count 665
Applied a total of 4 rules in 49 ms. Remains 792 /794 variables (removed 2) and now considering 665/667 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 792/794 places, 665/667 transitions.
RANDOM walk for 40000 steps (8 resets) in 638 ms. (62 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
// Phase 1: matrix 665 rows 792 cols
[2024-06-01 16:11:42] [INFO ] Computed 330 invariants in 3 ms
[2024-06-01 16:11:42] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 71/104 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 27/131 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 169/300 variables, 131/172 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 260/560 variables, 147/325 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 14/574 variables, 16/392 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 14/406 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 22/596 variables, 11/417 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/596 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 239/835 variables, 134/551 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/835 variables, 41/592 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/835 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/835 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 13/848 variables, 14/607 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/848 variables, 13/620 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/848 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (OVERLAPS) 21/869 variables, 11/631 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/869 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/869 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (OVERLAPS) 204/1073 variables, 129/761 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1073 variables, 38/799 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1073 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (OVERLAPS) 10/1083 variables, 13/812 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1083 variables, 10/822 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1083 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (OVERLAPS) 6/1089 variables, 3/825 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1089 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1089 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 36 (OVERLAPS) 86/1175 variables, 48/875 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1175 variables, 17/892 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1175 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 39 (OVERLAPS) 4/1179 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1179 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1179 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 42 (OVERLAPS) 8/1187 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1187 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 44 (OVERLAPS) 99/1286 variables, 57/961 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1286 variables, 15/976 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1286 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 47 (OVERLAPS) 4/1290 variables, 8/984 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1290 variables, 4/988 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1290 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 50 (OVERLAPS) 68/1358 variables, 37/1025 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1358 variables, 14/1039 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1358 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 53 (OVERLAPS) 4/1362 variables, 4/1043 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1362 variables, 4/1047 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1362 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 56 (OVERLAPS) 8/1370 variables, 4/1051 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1370 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 58 (OVERLAPS) 68/1438 variables, 41/1092 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1438 variables, 8/1100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1438 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 61 (OVERLAPS) 4/1442 variables, 8/1108 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1442 variables, 4/1112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1442 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 64 (OVERLAPS) 15/1457 variables, 12/1124 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1457 variables, 6/1130 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1457 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 67 (OVERLAPS) 0/1457 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1457/1457 variables, and 1130 constraints, problems are : Problem set: 0 solved, 23 unsolved in 8297 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 792/792 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 71/104 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 27/131 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 169/300 variables, 131/174 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 260/560 variables, 147/339 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 50/389 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 11/401 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 3/404 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 16:11:52] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 14/574 variables, 16/421 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 14/435 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 22/596 variables, 11/446 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/596 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 239/835 variables, 134/580 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/835 variables, 41/621 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/835 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/835 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 13/848 variables, 14/636 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/848 variables, 13/649 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/848 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (OVERLAPS) 21/869 variables, 11/660 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/869 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/869 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (OVERLAPS) 204/1073 variables, 129/790 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1073 variables, 38/828 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 16:11:54] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:11:54] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1073 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1073 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 36 (OVERLAPS) 10/1083 variables, 13/843 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1083 variables, 10/853 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1083 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 39 (OVERLAPS) 6/1089 variables, 3/856 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1089 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1089 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 42 (OVERLAPS) 86/1175 variables, 48/906 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1175 variables, 17/923 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1175 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 45 (OVERLAPS) 4/1179 variables, 4/927 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1179 variables, 4/931 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1179 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 48 (OVERLAPS) 8/1187 variables, 4/935 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1187 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 50 (OVERLAPS) 99/1286 variables, 57/992 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1286 variables, 15/1007 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1286 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 53 (OVERLAPS) 4/1290 variables, 8/1015 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1290 variables, 4/1019 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1290 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 56 (OVERLAPS) 68/1358 variables, 37/1056 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1358 variables, 14/1070 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 16:11:59] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1358 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1358 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 60 (OVERLAPS) 4/1362 variables, 4/1075 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1362 variables, 4/1079 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1362 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 63 (OVERLAPS) 8/1370 variables, 4/1083 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1370 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 65 (OVERLAPS) 68/1438 variables, 41/1124 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1438 variables, 8/1132 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1438 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 68 (OVERLAPS) 4/1442 variables, 8/1140 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1442 variables, 4/1144 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1442 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 71 (OVERLAPS) 15/1457 variables, 12/1156 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1457 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1457 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 74 (OVERLAPS) 0/1457 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1457/1457 variables, and 1162 constraints, problems are : Problem set: 0 solved, 23 unsolved in 13886 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 792/792 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 9/9 constraints]
After SMT, in 22196ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 803 ms.
Support contains 33 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 665/665 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 792 transition count 664
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 791 transition count 664
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 788 transition count 661
Applied a total of 8 rules in 42 ms. Remains 788 /792 variables (removed 4) and now considering 661/665 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 788/792 places, 661/665 transitions.
[2024-06-01 16:12:05] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:12:05] [INFO ] Flatten gal took : 58 ms
[2024-06-01 16:12:05] [INFO ] Input system was already deterministic with 1824 transitions.
Computed a total of 481 stabilizing places and 481 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2033 transition count 1404
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1614 transition count 1404
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 838 place count 1614 transition count 1176
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1294 place count 1386 transition count 1176
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1311 place count 1369 transition count 1159
Iterating global reduction 2 with 17 rules applied. Total rules applied 1328 place count 1369 transition count 1159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1328 place count 1369 transition count 1145
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 1356 place count 1355 transition count 1145
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 0 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 2316 place count 875 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2317 place count 875 transition count 664
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 2319 place count 874 transition count 663
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2321 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2322 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2322 place count 871 transition count 659
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 2326 place count 869 transition count 659
Applied a total of 2326 rules in 326 ms. Remains 869 /2034 variables (removed 1165) and now considering 659/1824 (removed 1165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 326 ms. Remains : 869/2034 places, 659/1824 transitions.
[2024-06-01 16:12:06] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:12:06] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:12:06] [INFO ] Input system was already deterministic with 659 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1613 transition count 1403
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 840 place count 1613 transition count 1175
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1296 place count 1385 transition count 1175
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1313 place count 1368 transition count 1158
Iterating global reduction 2 with 17 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1144
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 1358 place count 1354 transition count 1144
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 2320 place count 873 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2321 place count 873 transition count 662
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 2323 place count 872 transition count 661
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 2324 place count 872 transition count 661
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2326 place count 870 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2327 place count 869 transition count 659
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2327 place count 869 transition count 657
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 2331 place count 867 transition count 657
Applied a total of 2331 rules in 368 ms. Remains 867 /2034 variables (removed 1167) and now considering 657/1824 (removed 1167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 368 ms. Remains : 867/2034 places, 657/1824 transitions.
[2024-06-01 16:12:06] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:12:06] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:12:06] [INFO ] Input system was already deterministic with 657 transitions.
RANDOM walk for 39689 steps (8 resets) in 395 ms. (100 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2016 transition count 1806
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2016 transition count 1806
Applied a total of 36 rules in 166 ms. Remains 2016 /2034 variables (removed 18) and now considering 1806/1824 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 2016/2034 places, 1806/1824 transitions.
[2024-06-01 16:12:07] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:12:07] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:12:07] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2033 transition count 1402
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1612 transition count 1402
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 842 place count 1612 transition count 1174
Deduced a syphon composed of 228 places in 2 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1298 place count 1384 transition count 1174
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1314 place count 1368 transition count 1158
Iterating global reduction 2 with 16 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1145
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1356 place count 1355 transition count 1145
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 0 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 2320 place count 873 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2321 place count 873 transition count 662
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 2323 place count 872 transition count 661
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2325 place count 870 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2326 place count 869 transition count 659
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2326 place count 869 transition count 657
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 2330 place count 867 transition count 657
Applied a total of 2330 rules in 287 ms. Remains 867 /2034 variables (removed 1167) and now considering 657/1824 (removed 1167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 288 ms. Remains : 867/2034 places, 657/1824 transitions.
[2024-06-01 16:12:07] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:12:07] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:12:07] [INFO ] Input system was already deterministic with 657 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1613 transition count 1403
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 229 Pre rules applied. Total rules applied 840 place count 1613 transition count 1174
Deduced a syphon composed of 229 places in 2 ms
Reduce places removed 229 places and 0 transitions.
Iterating global reduction 2 with 458 rules applied. Total rules applied 1298 place count 1384 transition count 1174
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1315 place count 1367 transition count 1157
Iterating global reduction 2 with 17 rules applied. Total rules applied 1332 place count 1367 transition count 1157
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1332 place count 1367 transition count 1143
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 1360 place count 1353 transition count 1143
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 0 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 2 with 958 rules applied. Total rules applied 2318 place count 874 transition count 664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2319 place count 874 transition count 663
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 2321 place count 873 transition count 662
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2324 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2324 place count 870 transition count 658
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 2328 place count 868 transition count 658
Applied a total of 2328 rules in 247 ms. Remains 868 /2034 variables (removed 1166) and now considering 658/1824 (removed 1166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 247 ms. Remains : 868/2034 places, 658/1824 transitions.
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:12:08] [INFO ] Input system was already deterministic with 658 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1613 transition count 1403
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 840 place count 1613 transition count 1175
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 1296 place count 1385 transition count 1175
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1313 place count 1368 transition count 1158
Iterating global reduction 2 with 17 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1144
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 1358 place count 1354 transition count 1144
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 0 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 2318 place count 874 transition count 664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2319 place count 874 transition count 663
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 2321 place count 873 transition count 662
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2323 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2324 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2324 place count 870 transition count 658
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 2328 place count 868 transition count 658
Applied a total of 2328 rules in 257 ms. Remains 868 /2034 variables (removed 1166) and now considering 658/1824 (removed 1166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 259 ms. Remains : 868/2034 places, 658/1824 transitions.
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:12:08] [INFO ] Input system was already deterministic with 658 transitions.
RANDOM walk for 5 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2011 transition count 1801
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2011 transition count 1801
Applied a total of 46 rules in 174 ms. Remains 2011 /2034 variables (removed 23) and now considering 1801/1824 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 2011/2034 places, 1801/1824 transitions.
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:12:08] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2013 transition count 1803
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2013 transition count 1803
Applied a total of 42 rules in 155 ms. Remains 2013 /2034 variables (removed 21) and now considering 1803/1824 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 2013/2034 places, 1803/1824 transitions.
[2024-06-01 16:12:08] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:12:09] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2033 transition count 1403
Reduce places removed 420 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 421 rules applied. Total rules applied 841 place count 1613 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 842 place count 1612 transition count 1402
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 228 Pre rules applied. Total rules applied 842 place count 1612 transition count 1174
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 3 with 456 rules applied. Total rules applied 1298 place count 1384 transition count 1174
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1314 place count 1368 transition count 1158
Iterating global reduction 3 with 16 rules applied. Total rules applied 1330 place count 1368 transition count 1158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1330 place count 1368 transition count 1145
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1356 place count 1355 transition count 1145
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 2316 place count 875 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2317 place count 875 transition count 664
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 2319 place count 874 transition count 663
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2321 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2322 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2322 place count 871 transition count 659
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2326 place count 869 transition count 659
Applied a total of 2326 rules in 222 ms. Remains 869 /2034 variables (removed 1165) and now considering 659/1824 (removed 1165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 222 ms. Remains : 869/2034 places, 659/1824 transitions.
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 48 ms
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:12:09] [INFO ] Input system was already deterministic with 659 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2013 transition count 1803
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2013 transition count 1803
Applied a total of 42 rules in 153 ms. Remains 2013 /2034 variables (removed 21) and now considering 1803/1824 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 2013/2034 places, 1803/1824 transitions.
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:12:09] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2015 transition count 1805
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2015 transition count 1805
Applied a total of 38 rules in 149 ms. Remains 2015 /2034 variables (removed 19) and now considering 1805/1824 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 2015/2034 places, 1805/1824 transitions.
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:12:09] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:12:10] [INFO ] Input system was already deterministic with 1805 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2033 transition count 1406
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1616 transition count 1406
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 834 place count 1616 transition count 1181
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1284 place count 1391 transition count 1181
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1299 place count 1376 transition count 1166
Iterating global reduction 2 with 15 rules applied. Total rules applied 1314 place count 1376 transition count 1166
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1314 place count 1376 transition count 1154
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1338 place count 1364 transition count 1154
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 476
Deduced a syphon composed of 476 places in 1 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 2 with 952 rules applied. Total rules applied 2290 place count 888 transition count 678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2291 place count 888 transition count 677
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 2293 place count 887 transition count 676
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 2294 place count 887 transition count 676
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2296 place count 885 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2297 place count 884 transition count 674
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2297 place count 884 transition count 672
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 2301 place count 882 transition count 672
Applied a total of 2301 rules in 271 ms. Remains 882 /2034 variables (removed 1152) and now considering 672/1824 (removed 1152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 272 ms. Remains : 882/2034 places, 672/1824 transitions.
[2024-06-01 16:12:10] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:12:10] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:12:10] [INFO ] Input system was already deterministic with 672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2014 transition count 1804
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2014 transition count 1804
Applied a total of 40 rules in 148 ms. Remains 2014 /2034 variables (removed 20) and now considering 1804/1824 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 2014/2034 places, 1804/1824 transitions.
[2024-06-01 16:12:10] [INFO ] Flatten gal took : 48 ms
[2024-06-01 16:12:10] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:12:10] [INFO ] Input system was already deterministic with 1804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 2012 transition count 1802
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 2012 transition count 1802
Applied a total of 44 rules in 186 ms. Remains 2012 /2034 variables (removed 22) and now considering 1802/1824 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 2012/2034 places, 1802/1824 transitions.
[2024-06-01 16:12:10] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:12:11] [INFO ] Input system was already deterministic with 1802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2011 transition count 1801
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2011 transition count 1801
Applied a total of 46 rules in 148 ms. Remains 2011 /2034 variables (removed 23) and now considering 1801/1824 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 2011/2034 places, 1801/1824 transitions.
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:12:11] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 1824/1824 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2013 transition count 1803
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2013 transition count 1803
Applied a total of 42 rules in 167 ms. Remains 2013 /2034 variables (removed 21) and now considering 1803/1824 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 2013/2034 places, 1803/1824 transitions.
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:12:11] [INFO ] Input system was already deterministic with 1803 transitions.
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:12:11] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:12:11] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 16:12:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2034 places, 1824 transitions and 4728 arcs took 14 ms.
Total runtime 180444 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-02
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLFireability-2023-15

BK_STOP 1717258332129

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/769/ctl_0_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/769/ctl_1_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/769/ctl_2_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/769/ctl_3_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/769/ctl_4_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/769/ctl_5_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/769/ctl_6_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/769/ctl_7_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/769/ctl_8_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/769/ctl_9_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/769/ctl_10_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/769/ctl_11_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/769/ctl_12_
ctl formula name ShieldPPPt-PT-030B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/769/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-030B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-PT-030B, 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 r528-tall-171683761500650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;