About the Execution of GreatSPN+red for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11969.044 | 3600000.00 | 13729605.00 | 690.60 | ?????T??????F??? | normal |
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-171683759300681.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 ShieldPPPt-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759300681
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 955K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-050B-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717027223082
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 00:00:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 00:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:00:24] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-05-30 00:00:24] [INFO ] Transformed 3903 places.
[2024-05-30 00:00:24] [INFO ] Transformed 3553 transitions.
[2024-05-30 00:00:24] [INFO ] Found NUPN structural information;
[2024-05-30 00:00:24] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
FORMULA ShieldPPPt-PT-050B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 3386 transition count 3036
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 3386 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1035 place count 3385 transition count 3035
Iterating global reduction 0 with 1 rules applied. Total rules applied 1036 place count 3385 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1037 place count 3384 transition count 3034
Iterating global reduction 0 with 1 rules applied. Total rules applied 1038 place count 3384 transition count 3034
Applied a total of 1038 rules in 1550 ms. Remains 3384 /3903 variables (removed 519) and now considering 3034/3553 (removed 519) transitions.
// Phase 1: matrix 3034 rows 3384 cols
[2024-05-30 00:00:26] [INFO ] Computed 551 invariants in 37 ms
[2024-05-30 00:00:28] [INFO ] Implicit Places using invariants in 1430 ms returned []
[2024-05-30 00:00:28] [INFO ] Invariant cache hit.
[2024-05-30 00:00:31] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4790 ms to find 0 implicit places.
Running 3033 sub problems to find dead transitions.
[2024-05-30 00:00:31] [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 3383/6418 variables, and 0 constraints, problems are : Problem set: 0 solved, 3033 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3384 constraints, PredecessorRefiner: 3033/3033 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3033 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3383/6418 variables, and 0 constraints, problems are : Problem set: 0 solved, 3033 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3384 constraints, PredecessorRefiner: 0/3033 constraints, Known Traps: 0/0 constraints]
After SMT, in 61265ms problems are : Problem set: 0 solved, 3033 unsolved
Search for dead transitions found 0 dead transitions in 61313ms
Starting structural reductions in LTL mode, iteration 1 : 3384/3903 places, 3034/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67689 ms. Remains : 3384/3903 places, 3034/3553 transitions.
Support contains 171 out of 3384 places after structural reductions.
[2024-05-30 00:01:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 00:01:33] [INFO ] Flatten gal took : 185 ms
FORMULA ShieldPPPt-PT-050B-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:01:33] [INFO ] Flatten gal took : 123 ms
[2024-05-30 00:01:33] [INFO ] Input system was already deterministic with 3034 transitions.
Support contains 155 out of 3384 places (down from 171) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2583 ms. (15 steps per ms) remains 44/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
[2024-05-30 00:01:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 690/762 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/762 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2622/3384 variables, 467/551 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3384 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 3034/6418 variables, 3384/3935 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6418/6418 variables, and 3935 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3384/3384 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 690/762 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-30 00:01:40] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 11 ms to minimize.
[2024-05-30 00:01:40] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/762 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/762 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 2622/3384 variables, 467/553 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-30 00:01:42] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 11 ms to minimize.
[2024-05-30 00:01:43] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 10 ms to minimize.
[2024-05-30 00:01:43] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 8 ms to minimize.
[2024-05-30 00:01:44] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 8 ms to minimize.
[2024-05-30 00:01:44] [INFO ] Deduced a trap composed of 16 places in 404 ms of which 8 ms to minimize.
[2024-05-30 00:01:45] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 8 ms to minimize.
SMT process timed out in 10451ms, After SMT, problems are : Problem set: 0 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 3384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 662 place count 3384 transition count 2372
Reduce places removed 662 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 674 rules applied. Total rules applied 1336 place count 2722 transition count 2360
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1348 place count 2710 transition count 2360
Performed 377 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 377 Pre rules applied. Total rules applied 1348 place count 2710 transition count 1983
Deduced a syphon composed of 377 places in 4 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 3 with 754 rules applied. Total rules applied 2102 place count 2333 transition count 1983
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2117 place count 2318 transition count 1968
Iterating global reduction 3 with 15 rules applied. Total rules applied 2132 place count 2318 transition count 1968
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 2132 place count 2318 transition count 1957
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 2154 place count 2307 transition count 1957
Performed 831 Post agglomeration using F-continuation condition.Transition count delta: 831
Deduced a syphon composed of 831 places in 1 ms
Reduce places removed 831 places and 0 transitions.
Iterating global reduction 3 with 1662 rules applied. Total rules applied 3816 place count 1476 transition count 1126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3817 place count 1476 transition count 1125
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3819 place count 1475 transition count 1124
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4021 place count 1374 transition count 1124
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 4079 place count 1345 transition count 1124
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4082 place count 1345 transition count 1121
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4085 place count 1342 transition count 1121
Partial Free-agglomeration rule applied 143 times.
Drop transitions (Partial Free agglomeration) removed 143 transitions
Iterating global reduction 5 with 143 rules applied. Total rules applied 4228 place count 1342 transition count 1121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4229 place count 1341 transition count 1120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4230 place count 1340 transition count 1120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4230 place count 1340 transition count 1118
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4234 place count 1338 transition count 1118
Applied a total of 4234 rules in 1151 ms. Remains 1338 /3384 variables (removed 2046) and now considering 1118/3034 (removed 1916) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1151 ms. Remains : 1338/3384 places, 1118/3034 transitions.
RANDOM walk for 40000 steps (8 resets) in 894 ms. (44 steps per ms) remains 37/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
// Phase 1: matrix 1118 rows 1338 cols
[2024-05-30 00:01:47] [INFO ] Computed 550 invariants in 4 ms
[2024-05-30 00:01:47] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 200/262 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 92/354 variables, 39/116 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 423/777 variables, 354/470 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 11/481 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 492/1269 variables, 283/764 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1269 variables, 102/866 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1269 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1269 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 29/1298 variables, 32/899 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1298 variables, 29/928 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1298 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 47/1345 variables, 24/952 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1345 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1345 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (OVERLAPS) 494/1839 variables, 284/1237 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1839 variables, 72/1309 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1839 variables, 1/1310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1839 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (OVERLAPS) 37/1876 variables, 42/1352 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1876 variables, 34/1386 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1876 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (OVERLAPS) 54/1930 variables, 27/1413 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1930 variables, 0/1413 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (OVERLAPS) 289/2219 variables, 204/1617 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2219 variables, 62/1679 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2219 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (OVERLAPS) 10/2229 variables, 10/1689 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2229 variables, 10/1699 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2229 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (OVERLAPS) 20/2249 variables, 10/1709 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2249 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (OVERLAPS) 123/2372 variables, 86/1795 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2372 variables, 26/1821 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2372 variables, 0/1821 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (OVERLAPS) 2/2374 variables, 4/1825 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2374 variables, 2/1827 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2374 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (OVERLAPS) 53/2427 variables, 31/1858 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2427 variables, 10/1868 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2427 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (OVERLAPS) 3/2430 variables, 5/1873 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2430 variables, 3/1876 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2430 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (OVERLAPS) 2/2432 variables, 1/1877 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2432 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (OVERLAPS) 21/2453 variables, 15/1892 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2453 variables, 6/1898 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2453 variables, 0/1898 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (OVERLAPS) 3/2456 variables, 2/1900 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2456 variables, 1/1901 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2456 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (OVERLAPS) 0/2456 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 1901 constraints, problems are : Problem set: 0 solved, 37 unsolved in 24875 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1338/1338 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 200/262 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-30 00:02:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 92/354 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 423/777 variables, 354/472 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 11/483 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 17/500 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 492/1269 variables, 283/783 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1269 variables, 102/885 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1269 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1269 variables, 20/906 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:14] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-30 00:02:14] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-30 00:02:14] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-30 00:02:14] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-30 00:02:14] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1269 variables, 5/911 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1269 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1269 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 29/1298 variables, 32/944 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1298 variables, 29/973 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1298 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (OVERLAPS) 47/1345 variables, 24/997 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1345 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1345 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (OVERLAPS) 494/1839 variables, 284/1282 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1839 variables, 72/1354 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1839 variables, 1/1355 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1839 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (OVERLAPS) 37/1876 variables, 42/1397 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1876 variables, 34/1431 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1876 variables, 0/1431 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (OVERLAPS) 54/1930 variables, 27/1458 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1930 variables, 0/1458 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (OVERLAPS) 289/2219 variables, 204/1662 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2219 variables, 62/1724 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:25] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2219 variables, 1/1725 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2219 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (OVERLAPS) 10/2229 variables, 10/1735 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2229 variables, 10/1745 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2229 variables, 0/1745 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (OVERLAPS) 20/2249 variables, 10/1755 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2249 variables, 0/1755 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (OVERLAPS) 123/2372 variables, 86/1841 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2372 variables, 26/1867 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:34] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/2372 variables, 1/1868 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:35] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2372 variables, 1/1869 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2372 variables, 0/1869 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (OVERLAPS) 2/2374 variables, 4/1873 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2374 variables, 2/1875 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2374 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (OVERLAPS) 53/2427 variables, 31/1906 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2427 variables, 10/1916 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2427 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (OVERLAPS) 3/2430 variables, 5/1921 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2430 variables, 3/1924 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2430 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (OVERLAPS) 2/2432 variables, 1/1925 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2432 variables, 0/1925 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 57 (OVERLAPS) 21/2453 variables, 15/1940 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2453 variables, 6/1946 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2453 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 60 (OVERLAPS) 3/2456 variables, 2/1948 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2456 variables, 1/1949 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2456 variables, 0/1949 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:02:55] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
At refinement iteration 63 (OVERLAPS) 0/2456 variables, 1/1950 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 1950 constraints, problems are : Problem set: 0 solved, 37 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1338/1338 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 12/12 constraints]
After SMT, in 69924ms problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 1338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1338/1338 places, 1118/1118 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 1338 transition count 1116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1336 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1335 transition count 1115
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1335 transition count 1115
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 1327 transition count 1107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 1326 transition count 1106
Applied a total of 23 rules in 166 ms. Remains 1326 /1338 variables (removed 12) and now considering 1106/1118 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1326/1338 places, 1106/1118 transitions.
RANDOM walk for 40000 steps (8 resets) in 764 ms. (52 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 78593 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 37
Probabilistic random walk after 78593 steps, saw 61533 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 1106 rows 1326 cols
[2024-05-30 00:03:00] [INFO ] Computed 550 invariants in 3 ms
[2024-05-30 00:03:00] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 194/256 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 77/333 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 400/733 variables, 333/443 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/733 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 484/1217 variables, 276/727 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1217 variables, 101/828 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1217 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1217 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 27/1244 variables, 30/860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1244 variables, 27/887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1244 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 47/1291 variables, 24/911 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1291 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (OVERLAPS) 502/1793 variables, 289/1201 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1793 variables, 76/1277 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1793 variables, 1/1278 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1793 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (OVERLAPS) 36/1829 variables, 40/1318 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1829 variables, 36/1354 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1829 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (OVERLAPS) 60/1889 variables, 30/1384 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1889 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (OVERLAPS) 294/2183 variables, 207/1591 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2183 variables, 62/1653 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2183 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (OVERLAPS) 10/2193 variables, 10/1663 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2193 variables, 10/1673 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2193 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (OVERLAPS) 20/2213 variables, 10/1683 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2213 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (OVERLAPS) 134/2347 variables, 93/1776 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2347 variables, 28/1804 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2347 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (OVERLAPS) 3/2350 variables, 6/1810 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2350 variables, 3/1813 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2350 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (OVERLAPS) 53/2403 variables, 31/1844 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2403 variables, 10/1854 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2403 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (OVERLAPS) 3/2406 variables, 5/1859 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2406 variables, 3/1862 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2406 variables, 0/1862 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (OVERLAPS) 2/2408 variables, 1/1863 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2408 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (OVERLAPS) 21/2429 variables, 15/1878 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2429 variables, 6/1884 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2429 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (OVERLAPS) 3/2432 variables, 2/1886 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2432 variables, 1/1887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2432 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (OVERLAPS) 0/2432 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2432/2432 variables, and 1887 constraints, problems are : Problem set: 0 solved, 37 unsolved in 26609 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1326/1326 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 194/256 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 77/333 variables, 33/111 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:28] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-30 00:03:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 400/733 variables, 333/446 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/733 variables, 17/471 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:28] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/733 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/733 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 484/1217 variables, 276/748 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1217 variables, 101/849 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1217 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1217 variables, 20/871 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:30] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-30 00:03:30] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-30 00:03:30] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-30 00:03:30] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-30 00:03:30] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-30 00:03:30] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1217 variables, 6/877 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:32] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1217 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1217 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (OVERLAPS) 27/1244 variables, 30/908 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1244 variables, 27/935 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1244 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (OVERLAPS) 47/1291 variables, 24/959 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1291 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1291 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (OVERLAPS) 502/1793 variables, 289/1249 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1793 variables, 76/1325 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1793 variables, 1/1326 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:36] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1793 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1793 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (OVERLAPS) 36/1829 variables, 40/1367 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1829 variables, 36/1403 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1829 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (OVERLAPS) 60/1889 variables, 30/1433 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1889 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (OVERLAPS) 294/2183 variables, 207/1640 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2183 variables, 62/1702 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:43] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/2183 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2183 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (OVERLAPS) 10/2193 variables, 10/1713 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2193 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2193 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (OVERLAPS) 20/2213 variables, 10/1733 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 00:03:49] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/2213 variables, 1/1734 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2213 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (OVERLAPS) 134/2347 variables, 93/1827 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2347 variables, 28/1855 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2347 variables, 0/1855 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (OVERLAPS) 3/2350 variables, 6/1861 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2350 variables, 3/1864 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2350 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (OVERLAPS) 53/2403 variables, 31/1895 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2403 variables, 10/1905 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2403 variables, 0/1905 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (OVERLAPS) 3/2406 variables, 5/1910 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2406 variables, 3/1913 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2406 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 57 (OVERLAPS) 2/2408 variables, 1/1914 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2408 variables, 0/1914 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 59 (OVERLAPS) 21/2429 variables, 15/1929 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2429 variables, 6/1935 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2429 variables, 0/1935 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 62 (OVERLAPS) 3/2432 variables, 2/1937 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2432 variables, 1/1938 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2432 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 65 (OVERLAPS) 0/2432 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2432/2432 variables, and 1938 constraints, problems are : Problem set: 0 solved, 37 unsolved in 45255 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1326/1326 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 14/14 constraints]
After SMT, in 71890ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 4355 ms.
Support contains 62 out of 1326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1326/1326 places, 1106/1106 transitions.
Applied a total of 0 rules in 39 ms. Remains 1326 /1326 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1326/1326 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1326/1326 places, 1106/1106 transitions.
Applied a total of 0 rules in 38 ms. Remains 1326 /1326 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2024-05-30 00:04:17] [INFO ] Invariant cache hit.
[2024-05-30 00:04:17] [INFO ] Implicit Places using invariants in 684 ms returned [1307, 1311]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 687 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1324/1326 places, 1106/1106 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1322 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1322 transition count 1104
Applied a total of 4 rules in 69 ms. Remains 1322 /1324 variables (removed 2) and now considering 1104/1106 (removed 2) transitions.
// Phase 1: matrix 1104 rows 1322 cols
[2024-05-30 00:04:17] [INFO ] Computed 548 invariants in 7 ms
[2024-05-30 00:04:18] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-30 00:04:18] [INFO ] Invariant cache hit.
[2024-05-30 00:04:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 00:04:20] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1322/1326 places, 1104/1106 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2993 ms. Remains : 1322/1326 places, 1104/1106 transitions.
[2024-05-30 00:04:20] [INFO ] Flatten gal took : 89 ms
[2024-05-30 00:04:20] [INFO ] Flatten gal took : 89 ms
[2024-05-30 00:04:20] [INFO ] Input system was already deterministic with 3034 transitions.
Computed a total of 807 stabilizing places and 807 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3355 transition count 3005
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3355 transition count 3005
Applied a total of 58 rules in 659 ms. Remains 3355 /3384 variables (removed 29) and now considering 3005/3034 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 ms. Remains : 3355/3384 places, 3005/3034 transitions.
[2024-05-30 00:04:21] [INFO ] Flatten gal took : 69 ms
[2024-05-30 00:04:21] [INFO ] Flatten gal took : 71 ms
[2024-05-30 00:04:21] [INFO ] Input system was already deterministic with 3005 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 670 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-05-30 00:04:22] [INFO ] Flatten gal took : 62 ms
[2024-05-30 00:04:22] [INFO ] Flatten gal took : 66 ms
[2024-05-30 00:04:22] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 682 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-05-30 00:04:23] [INFO ] Flatten gal took : 64 ms
[2024-05-30 00:04:23] [INFO ] Flatten gal took : 68 ms
[2024-05-30 00:04:23] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 682 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-05-30 00:04:24] [INFO ] Flatten gal took : 57 ms
[2024-05-30 00:04:24] [INFO ] Flatten gal took : 60 ms
[2024-05-30 00:04:24] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 3352 transition count 3002
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 3352 transition count 3002
Applied a total of 64 rules in 692 ms. Remains 3352 /3384 variables (removed 32) and now considering 3002/3034 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 3352/3384 places, 3002/3034 transitions.
[2024-05-30 00:04:25] [INFO ] Flatten gal took : 58 ms
[2024-05-30 00:04:25] [INFO ] Flatten gal took : 61 ms
[2024-05-30 00:04:25] [INFO ] Input system was already deterministic with 3002 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 703 rules applied. Total rules applied 703 place count 3383 transition count 2330
Reduce places removed 703 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 704 rules applied. Total rules applied 1407 place count 2680 transition count 2329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1408 place count 2679 transition count 2329
Performed 383 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 383 Pre rules applied. Total rules applied 1408 place count 2679 transition count 1946
Deduced a syphon composed of 383 places in 3 ms
Reduce places removed 383 places and 0 transitions.
Iterating global reduction 3 with 766 rules applied. Total rules applied 2174 place count 2296 transition count 1946
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2199 place count 2271 transition count 1921
Iterating global reduction 3 with 25 rules applied. Total rules applied 2224 place count 2271 transition count 1921
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2224 place count 2271 transition count 1900
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2266 place count 2250 transition count 1900
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 797
Deduced a syphon composed of 797 places in 1 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 3860 place count 1453 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3861 place count 1453 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3863 place count 1452 transition count 1101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3865 place count 1450 transition count 1099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3866 place count 1449 transition count 1099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3866 place count 1449 transition count 1097
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3870 place count 1447 transition count 1097
Applied a total of 3870 rules in 666 ms. Remains 1447 /3384 variables (removed 1937) and now considering 1097/3034 (removed 1937) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 666 ms. Remains : 1447/3384 places, 1097/3034 transitions.
[2024-05-30 00:04:26] [INFO ] Flatten gal took : 27 ms
[2024-05-30 00:04:26] [INFO ] Flatten gal took : 28 ms
[2024-05-30 00:04:26] [INFO ] Input system was already deterministic with 1097 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 3383 transition count 2331
Reduce places removed 702 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 704 rules applied. Total rules applied 1406 place count 2681 transition count 2329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1408 place count 2679 transition count 2329
Performed 384 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 384 Pre rules applied. Total rules applied 1408 place count 2679 transition count 1945
Deduced a syphon composed of 384 places in 3 ms
Reduce places removed 384 places and 0 transitions.
Iterating global reduction 3 with 768 rules applied. Total rules applied 2176 place count 2295 transition count 1945
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2201 place count 2270 transition count 1920
Iterating global reduction 3 with 25 rules applied. Total rules applied 2226 place count 2270 transition count 1920
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2226 place count 2270 transition count 1899
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2268 place count 2249 transition count 1899
Performed 793 Post agglomeration using F-continuation condition.Transition count delta: 793
Deduced a syphon composed of 793 places in 1 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 3854 place count 1456 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3855 place count 1456 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3857 place count 1455 transition count 1104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3859 place count 1453 transition count 1102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3860 place count 1452 transition count 1102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3860 place count 1452 transition count 1100
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3864 place count 1450 transition count 1100
Applied a total of 3864 rules in 630 ms. Remains 1450 /3384 variables (removed 1934) and now considering 1100/3034 (removed 1934) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 631 ms. Remains : 1450/3384 places, 1100/3034 transitions.
[2024-05-30 00:04:26] [INFO ] Flatten gal took : 25 ms
[2024-05-30 00:04:26] [INFO ] Flatten gal took : 27 ms
[2024-05-30 00:04:26] [INFO ] Input system was already deterministic with 1100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3357 transition count 3007
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3357 transition count 3007
Applied a total of 54 rules in 739 ms. Remains 3357 /3384 variables (removed 27) and now considering 3007/3034 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 3357/3384 places, 3007/3034 transitions.
[2024-05-30 00:04:27] [INFO ] Flatten gal took : 55 ms
[2024-05-30 00:04:27] [INFO ] Flatten gal took : 56 ms
[2024-05-30 00:04:27] [INFO ] Input system was already deterministic with 3007 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 675 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-05-30 00:04:28] [INFO ] Flatten gal took : 54 ms
[2024-05-30 00:04:28] [INFO ] Flatten gal took : 56 ms
[2024-05-30 00:04:28] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 3383 transition count 2331
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 2681 transition count 2331
Performed 382 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 382 Pre rules applied. Total rules applied 1404 place count 2681 transition count 1949
Deduced a syphon composed of 382 places in 3 ms
Reduce places removed 382 places and 0 transitions.
Iterating global reduction 2 with 764 rules applied. Total rules applied 2168 place count 2299 transition count 1949
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2192 place count 2275 transition count 1925
Iterating global reduction 2 with 24 rules applied. Total rules applied 2216 place count 2275 transition count 1925
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2216 place count 2275 transition count 1904
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 2258 place count 2254 transition count 1904
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 798
Deduced a syphon composed of 798 places in 1 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 3854 place count 1456 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3855 place count 1456 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3857 place count 1455 transition count 1104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3859 place count 1453 transition count 1102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3860 place count 1452 transition count 1102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3860 place count 1452 transition count 1100
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3864 place count 1450 transition count 1100
Applied a total of 3864 rules in 636 ms. Remains 1450 /3384 variables (removed 1934) and now considering 1100/3034 (removed 1934) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 636 ms. Remains : 1450/3384 places, 1100/3034 transitions.
[2024-05-30 00:04:29] [INFO ] Flatten gal took : 24 ms
[2024-05-30 00:04:29] [INFO ] Flatten gal took : 26 ms
[2024-05-30 00:04:29] [INFO ] Input system was already deterministic with 1100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 695 place count 3383 transition count 2338
Reduce places removed 695 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 696 rules applied. Total rules applied 1391 place count 2688 transition count 2337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1392 place count 2687 transition count 2337
Performed 381 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 381 Pre rules applied. Total rules applied 1392 place count 2687 transition count 1956
Deduced a syphon composed of 381 places in 3 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 3 with 762 rules applied. Total rules applied 2154 place count 2306 transition count 1956
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2175 place count 2285 transition count 1935
Iterating global reduction 3 with 21 rules applied. Total rules applied 2196 place count 2285 transition count 1935
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 2196 place count 2285 transition count 1916
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 2234 place count 2266 transition count 1916
Performed 795 Post agglomeration using F-continuation condition.Transition count delta: 795
Deduced a syphon composed of 795 places in 1 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3824 place count 1471 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3825 place count 1471 transition count 1120
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3827 place count 1470 transition count 1119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3829 place count 1468 transition count 1117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3830 place count 1467 transition count 1117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3830 place count 1467 transition count 1115
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3834 place count 1465 transition count 1115
Applied a total of 3834 rules in 617 ms. Remains 1465 /3384 variables (removed 1919) and now considering 1115/3034 (removed 1919) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 617 ms. Remains : 1465/3384 places, 1115/3034 transitions.
[2024-05-30 00:04:30] [INFO ] Flatten gal took : 36 ms
[2024-05-30 00:04:30] [INFO ] Flatten gal took : 38 ms
[2024-05-30 00:04:30] [INFO ] Input system was already deterministic with 1115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 711 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 711 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-05-30 00:04:31] [INFO ] Flatten gal took : 58 ms
[2024-05-30 00:04:31] [INFO ] Flatten gal took : 60 ms
[2024-05-30 00:04:31] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 3353 transition count 3003
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 3353 transition count 3003
Applied a total of 62 rules in 673 ms. Remains 3353 /3384 variables (removed 31) and now considering 3003/3034 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 3353/3384 places, 3003/3034 transitions.
[2024-05-30 00:04:32] [INFO ] Flatten gal took : 53 ms
[2024-05-30 00:04:32] [INFO ] Flatten gal took : 56 ms
[2024-05-30 00:04:32] [INFO ] Input system was already deterministic with 3003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3355 transition count 3005
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3355 transition count 3005
Applied a total of 58 rules in 674 ms. Remains 3355 /3384 variables (removed 29) and now considering 3005/3034 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 3355/3384 places, 3005/3034 transitions.
[2024-05-30 00:04:33] [INFO ] Flatten gal took : 54 ms
[2024-05-30 00:04:33] [INFO ] Flatten gal took : 57 ms
[2024-05-30 00:04:33] [INFO ] Input system was already deterministic with 3005 transitions.
[2024-05-30 00:04:33] [INFO ] Flatten gal took : 56 ms
[2024-05-30 00:04:33] [INFO ] Flatten gal took : 58 ms
[2024-05-30 00:04:33] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-30 00:04:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3384 places, 3034 transitions and 7868 arcs took 13 ms.
Total runtime 249098 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPt-PT-050B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3384
TRANSITIONS: 3034
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.010s]
SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.003s]
----------------------------------------------------------------------
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: 753
MODEL NAME: /home/mcc/execution/408/model
3384 places, 3034 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 CTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldPPPt-PT-050B, examination is CTLCardinality"
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-171683759300681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;