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.r355-tall-171683760001018.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 greatspnxred
Input is ShieldRVt-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760001018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 489K 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 ShieldRVt-PT-040B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717083596989

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:39:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 15:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:39:58] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-30 15:39:58] [INFO ] Transformed 2003 places.
[2024-05-30 15:39:58] [INFO ] Transformed 2003 transitions.
[2024-05-30 15:39:58] [INFO ] Found NUPN structural information;
[2024-05-30 15:39:58] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 140 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 402 places :
Symmetric choice reduction at 0 with 402 rule applications. Total rules 402 place count 1601 transition count 1601
Iterating global reduction 0 with 402 rules applied. Total rules applied 804 place count 1601 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 805 place count 1600 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 806 place count 1600 transition count 1600
Applied a total of 806 rules in 435 ms. Remains 1600 /2003 variables (removed 403) and now considering 1600/2003 (removed 403) transitions.
// Phase 1: matrix 1600 rows 1600 cols
[2024-05-30 15:39:59] [INFO ] Computed 161 invariants in 30 ms
[2024-05-30 15:39:59] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-30 15:39:59] [INFO ] Invariant cache hit.
[2024-05-30 15:40:01] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2024-05-30 15:40:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1599/3200 variables, and 0 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1599/3200 variables, and 0 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 1600/2003 places, 1600/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62913 ms. Remains : 1600/2003 places, 1600/2003 transitions.
Support contains 140 out of 1600 places after structural reductions.
[2024-05-30 15:41:01] [INFO ] Flatten gal took : 132 ms
[2024-05-30 15:41:02] [INFO ] Flatten gal took : 75 ms
[2024-05-30 15:41:02] [INFO ] Input system was already deterministic with 1600 transitions.
RANDOM walk for 40000 steps (9 resets) in 1860 ms. (21 steps per ms) remains 42/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
[2024-05-30 15:41:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1238/1318 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 282/1600 variables, 32/161 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1600 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1600/3200 variables, 1600/1761 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3200 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/3200 variables, and 1761 constraints, problems are : Problem set: 0 solved, 42 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1600/1600 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 1238/1318 variables, 129/129 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-05-30 15:41:08] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 33 ms to minimize.
[2024-05-30 15:41:08] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-05-30 15:41:08] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-30 15:41:10] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-30 15:41:10] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-30 15:41:10] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-30 15:41:10] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-30 15:41:10] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-30 15:41:10] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-30 15:41:11] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1318 variables, 18/147 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-05-30 15:41:12] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 3 ms to minimize.
[2024-05-30 15:41:12] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1318/3200 variables, and 149 constraints, problems are : Problem set: 1 solved, 41 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 129/161 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 0/42 constraints, Known Traps: 20/20 constraints]
After SMT, in 10042ms problems are : Problem set: 1 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 1600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 1600 transition count 1201
Reduce places removed 399 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 413 rules applied. Total rules applied 812 place count 1201 transition count 1187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 826 place count 1187 transition count 1187
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 826 place count 1187 transition count 915
Deduced a syphon composed of 272 places in 5 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 1370 place count 915 transition count 915
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1386 place count 899 transition count 899
Iterating global reduction 3 with 16 rules applied. Total rules applied 1402 place count 899 transition count 899
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1402 place count 899 transition count 886
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 1428 place count 886 transition count 886
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 2 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 3 with 708 rules applied. Total rules applied 2136 place count 532 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2137 place count 532 transition count 531
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2139 place count 531 transition count 530
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 2335 place count 433 transition count 607
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 2340 place count 433 transition count 602
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2345 place count 428 transition count 602
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2348 place count 428 transition count 599
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2349 place count 427 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2350 place count 426 transition count 598
Applied a total of 2350 rules in 348 ms. Remains 426 /1600 variables (removed 1174) and now considering 598/1600 (removed 1002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 426/1600 places, 598/1600 transitions.
RANDOM walk for 40000 steps (8 resets) in 743 ms. (53 steps per ms) remains 20/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
// Phase 1: matrix 598 rows 426 cols
[2024-05-30 15:41:13] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 15:41:13] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 134/173 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/181 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 315/496 variables, 181/240 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 73/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 249/745 variables, 112/425 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 46/471 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/745 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 16/761 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/761 variables, 6/489 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 137/898 variables, 63/552 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/898 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/898 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 8/906 variables, 5/581 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 77/983 variables, 38/621 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/983 variables, 11/632 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/983 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/983 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (OVERLAPS) 6/989 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/989 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/989 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 33/1022 variables, 18/662 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1022 variables, 5/667 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1022 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (OVERLAPS) 2/1024 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1024 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1024 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 35 (OVERLAPS) 0/1024 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 671 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3444 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 426/426 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 134/173 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 15:41:17] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 8/181 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 315/496 variables, 181/241 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 73/314 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 16/330 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 15:41:18] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 249/745 variables, 112/443 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/745 variables, 46/489 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/745 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/745 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/745 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 16/761 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/761 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/761 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 137/898 variables, 63/574 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/898 variables, 20/594 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/898 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/898 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 8/906 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/906 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (OVERLAPS) 77/983 variables, 38/643 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/983 variables, 11/654 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/983 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/983 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (OVERLAPS) 6/989 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/989 variables, 4/666 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/989 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 33/1022 variables, 18/684 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1022 variables, 5/689 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1022 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 36 (OVERLAPS) 2/1024 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1024 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1024 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 0/1024 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 693 constraints, problems are : Problem set: 0 solved, 20 unsolved in 7918 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 426/426 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 11387ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 6239 ms.
Support contains 39 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 598/598 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 426 transition count 590
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 418 transition count 590
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 16 place count 418 transition count 570
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 56 place count 398 transition count 570
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 388 transition count 560
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 377 transition count 571
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 377 transition count 570
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 374 transition count 567
Applied a total of 102 rules in 71 ms. Remains 374 /426 variables (removed 52) and now considering 567/598 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 374/426 places, 567/598 transitions.
RANDOM walk for 40000 steps (8 resets) in 820 ms. (48 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
// Phase 1: matrix 567 rows 374 cols
[2024-05-30 15:41:31] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 15:41:32] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 60/86 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 50/136 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 231/367 variables, 136/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 67/251 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 204/571 variables, 81/332 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 38/370 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 4/575 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 130/705 variables, 58/433 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 25/458 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 2/707 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/707 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 84/791 variables, 34/493 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/791 variables, 15/508 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/791 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 2/793 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/793 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 84/877 variables, 34/543 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/877 variables, 16/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/877 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 54/931 variables, 24/583 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/931 variables, 11/594 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/931 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 2/933 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/933 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (OVERLAPS) 8/941 variables, 6/601 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/941 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/941 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (OVERLAPS) 0/941 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 941/941 variables, and 603 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 374/374 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 60/86 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 50/136 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 231/367 variables, 136/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 67/251 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 13/264 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 204/571 variables, 81/345 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 38/383 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 4/575 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/575 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 130/705 variables, 58/448 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 25/473 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/705 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 2/707 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/707 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 84/791 variables, 34/508 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/791 variables, 15/523 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/791 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 2/793 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/793 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 84/877 variables, 34/558 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/877 variables, 16/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/877 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (OVERLAPS) 54/931 variables, 24/598 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/931 variables, 11/609 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/931 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (OVERLAPS) 2/933 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/933 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (OVERLAPS) 8/941 variables, 6/616 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/941 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/941 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (OVERLAPS) 0/941 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 941/941 variables, and 618 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4048 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 374/374 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 6450ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 3949 ms.
Support contains 26 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 567/567 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 374 transition count 565
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 372 transition count 565
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 372 transition count 558
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 365 transition count 558
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 361 transition count 554
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 356 transition count 560
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 356 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 355 transition count 557
Applied a total of 39 rules in 43 ms. Remains 355 /374 variables (removed 19) and now considering 557/567 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 355/374 places, 557/567 transitions.
RANDOM walk for 40000 steps (13 resets) in 530 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 126908 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 14
Probabilistic random walk after 126908 steps, saw 87447 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 557 rows 355 cols
[2024-05-30 15:41:45] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 15:41:45] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/70 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 148/218 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 249/467 variables, 104/194 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 52/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 114/581 variables, 52/299 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 24/323 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 4/585 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/585 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 42/627 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/627 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/627 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 44/671 variables, 16/370 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/671 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/671 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 44/715 variables, 16/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/715 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/715 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (OVERLAPS) 44/759 variables, 16/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/759 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/759 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 44/803 variables, 16/442 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/803 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/803 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (OVERLAPS) 44/847 variables, 16/466 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/847 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/847 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (OVERLAPS) 40/887 variables, 16/490 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/887 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/887 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (OVERLAPS) 24/911 variables, 12/510 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/911 variables, 5/515 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/911 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (OVERLAPS) 1/912 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/912 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/912 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (OVERLAPS) 0/912 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 517 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1924 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 355/355 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/70 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 148/218 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 249/467 variables, 104/200 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 52/252 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 114/581 variables, 52/313 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 24/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 4/585 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/585 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 42/627 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/627 variables, 8/368 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/627 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 44/671 variables, 16/384 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/671 variables, 8/392 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/671 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 44/715 variables, 16/408 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/715 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/715 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 44/759 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/759 variables, 8/440 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/759 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (OVERLAPS) 44/803 variables, 16/456 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/803 variables, 8/464 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/803 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 44/847 variables, 16/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/847 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/847 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (OVERLAPS) 40/887 variables, 16/504 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/887 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/887 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (OVERLAPS) 24/911 variables, 12/524 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/911 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/911 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (OVERLAPS) 1/912 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/912 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/912 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (OVERLAPS) 0/912 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 531 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2923 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 355/355 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 4857ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2563 ms.
Support contains 23 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 557/557 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 355 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 353 transition count 555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 353 transition count 554
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 352 transition count 554
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 351 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 350 transition count 555
Applied a total of 9 rules in 43 ms. Remains 350 /355 variables (removed 5) and now considering 555/557 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 350/355 places, 555/557 transitions.
RANDOM walk for 40000 steps (8 resets) in 546 ms. (73 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 299 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 144246 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 14
Probabilistic random walk after 144246 steps, saw 102022 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 555 rows 350 cols
[2024-05-30 15:41:57] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 15:41:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/70 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 148/218 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 252/470 variables, 104/194 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 52/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 112/582 variables, 52/299 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 26/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 40/622 variables, 16/341 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 44/666 variables, 16/365 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/666 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 44/710 variables, 16/389 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/710 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/710 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 44/754 variables, 16/413 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/754 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/754 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (OVERLAPS) 44/798 variables, 16/437 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/798 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/798 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 44/842 variables, 16/461 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/842 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/842 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (OVERLAPS) 40/882 variables, 16/485 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/882 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/882 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (OVERLAPS) 23/905 variables, 12/505 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/905 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/905 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (OVERLAPS) 0/905 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 905/905 variables, and 511 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 350/350 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/70 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 148/218 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 252/470 variables, 104/200 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 52/252 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 112/582 variables, 52/313 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 26/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 40/622 variables, 16/355 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/622 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 44/666 variables, 16/379 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/666 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 44/710 variables, 16/403 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/710 variables, 8/411 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/710 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 44/754 variables, 16/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/754 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/754 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 44/798 variables, 16/451 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/798 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/798 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (OVERLAPS) 44/842 variables, 16/475 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/842 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 40/882 variables, 16/499 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/882 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/882 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (OVERLAPS) 23/905 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/905 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/905 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (OVERLAPS) 0/905 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 905/905 variables, and 525 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2431 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 350/350 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 4102ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1947 ms.
Support contains 23 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 555/555 transitions.
Applied a total of 0 rules in 11 ms. Remains 350 /350 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 350/350 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 350 /350 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-30 15:42:03] [INFO ] Invariant cache hit.
[2024-05-30 15:42:03] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-30 15:42:03] [INFO ] Invariant cache hit.
[2024-05-30 15:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 15:42:04] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-30 15:42:04] [INFO ] Redundant transitions in 24 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-30 15:42:04] [INFO ] Invariant cache hit.
[2024-05-30 15:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 7/350 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 555/905 variables, 350/510 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 905/905 variables, and 511 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 350/350 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 7/350 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 555/905 variables, 350/510 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 545/1056 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/905 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 8 (OVERLAPS) 0/905 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 545 unsolved
No progress, stopping.
After SMT solving in domain Int declared 905/905 variables, and 1056 constraints, problems are : Problem set: 0 solved, 545 unsolved in 29931 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 350/350 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60769 ms. Remains : 350/350 places, 555/555 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-30 15:43:04] [INFO ] Flatten gal took : 60 ms
[2024-05-30 15:43:04] [INFO ] Flatten gal took : 48 ms
[2024-05-30 15:43:04] [INFO ] Input system was already deterministic with 1600 transitions.
Computed a total of 494 stabilizing places and 494 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1564 transition count 1564
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1564 transition count 1564
Applied a total of 72 rules in 125 ms. Remains 1564 /1600 variables (removed 36) and now considering 1564/1600 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 1564/1600 places, 1564/1600 transitions.
[2024-05-30 15:43:04] [INFO ] Flatten gal took : 52 ms
[2024-05-30 15:43:04] [INFO ] Flatten gal took : 43 ms
[2024-05-30 15:43:04] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1567 transition count 1567
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1567 transition count 1567
Applied a total of 66 rules in 104 ms. Remains 1567 /1600 variables (removed 33) and now considering 1567/1600 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 1567/1600 places, 1567/1600 transitions.
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 36 ms
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 44 ms
[2024-05-30 15:43:05] [INFO ] Input system was already deterministic with 1567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1561 transition count 1561
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1561 transition count 1561
Applied a total of 78 rules in 109 ms. Remains 1561 /1600 variables (removed 39) and now considering 1561/1600 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 1561/1600 places, 1561/1600 transitions.
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:43:05] [INFO ] Input system was already deterministic with 1561 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1562 transition count 1562
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1562 transition count 1562
Applied a total of 76 rules in 104 ms. Remains 1562 /1600 variables (removed 38) and now considering 1562/1600 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1562/1600 places, 1562/1600 transitions.
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 32 ms
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 35 ms
[2024-05-30 15:43:05] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1562 transition count 1562
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1562 transition count 1562
Applied a total of 76 rules in 115 ms. Remains 1562 /1600 variables (removed 38) and now considering 1562/1600 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 1562/1600 places, 1562/1600 transitions.
[2024-05-30 15:43:05] [INFO ] Flatten gal took : 35 ms
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 33 ms
[2024-05-30 15:43:06] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1563 transition count 1563
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1563 transition count 1563
Applied a total of 74 rules in 117 ms. Remains 1563 /1600 variables (removed 37) and now considering 1563/1600 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 1563/1600 places, 1563/1600 transitions.
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 30 ms
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 42 ms
[2024-05-30 15:43:06] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1563 transition count 1563
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1563 transition count 1563
Applied a total of 74 rules in 134 ms. Remains 1563 /1600 variables (removed 37) and now considering 1563/1600 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 1563/1600 places, 1563/1600 transitions.
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 30 ms
[2024-05-30 15:43:06] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1562 transition count 1562
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1562 transition count 1562
Applied a total of 76 rules in 102 ms. Remains 1562 /1600 variables (removed 38) and now considering 1562/1600 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 1562/1600 places, 1562/1600 transitions.
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:43:06] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:43:06] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 1599 transition count 1150
Reduce places removed 449 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 450 rules applied. Total rules applied 899 place count 1150 transition count 1149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 900 place count 1149 transition count 1149
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 297 Pre rules applied. Total rules applied 900 place count 1149 transition count 852
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 594 rules applied. Total rules applied 1494 place count 852 transition count 852
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1523 place count 823 transition count 823
Iterating global reduction 3 with 29 rules applied. Total rules applied 1552 place count 823 transition count 823
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 1552 place count 823 transition count 798
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1602 place count 798 transition count 798
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2228 place count 485 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2229 place count 485 transition count 484
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 2231 place count 484 transition count 483
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 482 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2234 place count 481 transition count 481
Applied a total of 2234 rules in 194 ms. Remains 481 /1600 variables (removed 1119) and now considering 481/1600 (removed 1119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 195 ms. Remains : 481/1600 places, 481/1600 transitions.
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:43:07] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1565 transition count 1565
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1565 transition count 1565
Applied a total of 70 rules in 119 ms. Remains 1565 /1600 variables (removed 35) and now considering 1565/1600 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1565/1600 places, 1565/1600 transitions.
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 27 ms
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:43:07] [INFO ] Input system was already deterministic with 1565 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1564 transition count 1564
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1564 transition count 1564
Applied a total of 72 rules in 106 ms. Remains 1564 /1600 variables (removed 36) and now considering 1564/1600 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 1564/1600 places, 1564/1600 transitions.
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:43:07] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1564 transition count 1564
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1564 transition count 1564
Applied a total of 72 rules in 100 ms. Remains 1564 /1600 variables (removed 36) and now considering 1564/1600 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 1564/1600 places, 1564/1600 transitions.
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 27 ms
[2024-05-30 15:43:07] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:43:07] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 1599 transition count 1150
Reduce places removed 449 places and 0 transitions.
Iterating post reduction 1 with 449 rules applied. Total rules applied 898 place count 1150 transition count 1150
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 299 Pre rules applied. Total rules applied 898 place count 1150 transition count 851
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1496 place count 851 transition count 851
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1525 place count 822 transition count 822
Iterating global reduction 2 with 29 rules applied. Total rules applied 1554 place count 822 transition count 822
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 1554 place count 822 transition count 797
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 1604 place count 797 transition count 797
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 0 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 2224 place count 487 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2225 place count 487 transition count 486
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 2227 place count 486 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2229 place count 484 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2230 place count 483 transition count 483
Applied a total of 2230 rules in 140 ms. Remains 483 /1600 variables (removed 1117) and now considering 483/1600 (removed 1117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 140 ms. Remains : 483/1600 places, 483/1600 transitions.
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:43:08] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1563 transition count 1563
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1563 transition count 1563
Applied a total of 74 rules in 103 ms. Remains 1563 /1600 variables (removed 37) and now considering 1563/1600 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 1563/1600 places, 1563/1600 transitions.
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 27 ms
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:43:08] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1566 transition count 1566
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1566 transition count 1566
Applied a total of 68 rules in 102 ms. Remains 1566 /1600 variables (removed 34) and now considering 1566/1600 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 1566/1600 places, 1566/1600 transitions.
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 26 ms
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 27 ms
[2024-05-30 15:43:08] [INFO ] Input system was already deterministic with 1566 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1599 transition count 1157
Reduce places removed 442 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 444 rules applied. Total rules applied 886 place count 1157 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 888 place count 1155 transition count 1155
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 888 place count 1155 transition count 863
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1472 place count 863 transition count 863
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1497 place count 838 transition count 838
Iterating global reduction 3 with 25 rules applied. Total rules applied 1522 place count 838 transition count 838
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1522 place count 838 transition count 817
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1564 place count 817 transition count 817
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2190 place count 504 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2191 place count 504 transition count 503
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 2193 place count 503 transition count 502
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2195 place count 501 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2196 place count 500 transition count 500
Applied a total of 2196 rules in 123 ms. Remains 500 /1600 variables (removed 1100) and now considering 500/1600 (removed 1100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 500/1600 places, 500/1600 transitions.
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 33 ms
[2024-05-30 15:43:08] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 45 ms
[2024-05-30 15:43:08] [INFO ] Flatten gal took : 30 ms
[2024-05-30 15:43:08] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-30 15:43:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1600 places, 1600 transitions and 3920 arcs took 13 ms.
Total runtime 190721 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1600
TRANSITIONS: 1600
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 686
MODEL NAME: /home/mcc/execution/412/model
1600 places, 1600 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="ShieldRVt-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVt-PT-040B, 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 r355-tall-171683760001018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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