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.r100-tall-171624200700342.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 DBSingleClientW-PT-d2m04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200700342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716365302229

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:08:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:08:23] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-22 08:08:23] [INFO ] Transformed 4763 places.
[2024-05-22 08:08:23] [INFO ] Transformed 2478 transitions.
[2024-05-22 08:08:23] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 317 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 4763/4763 places, 2478/2478 transitions.
Reduce places removed 3626 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 3825 rules applied. Total rules applied 3825 place count 1137 transition count 2279
Applied a total of 3825 rules in 96 ms. Remains 1137 /4763 variables (removed 3626) and now considering 2279/2478 (removed 199) transitions.
// Phase 1: matrix 2279 rows 1137 cols
[2024-05-22 08:08:23] [INFO ] Computed 2 invariants in 87 ms
[2024-05-22 08:08:24] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-22 08:08:24] [INFO ] Invariant cache hit.
[2024-05-22 08:08:25] [INFO ] State equation strengthened by 1389 read => feed constraints.
[2024-05-22 08:08:39] [INFO ] Implicit Places using invariants and state equation in 14800 ms returned []
Implicit Place search using SMT with State Equation took 15749 ms to find 0 implicit places.
Running 2278 sub problems to find dead transitions.
[2024-05-22 08:08:39] [INFO ] Invariant cache hit.
[2024-05-22 08:08:39] [INFO ] State equation strengthened by 1389 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 2278/2270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 8/2270 constraints, Known Traps: 0/0 constraints]
After SMT, in 86469ms problems are : Problem set: 0 solved, 2278 unsolved
Search for dead transitions found 0 dead transitions in 86509ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1137/4763 places, 2279/2478 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 102396 ms. Remains : 1137/4763 places, 2279/2478 transitions.
Discarding 1145 transitions out of 2279. Remains 1134
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9133 resets) in 5736 ms. (6 steps per ms) remains 1061/1133 properties
BEST_FIRST walk for 121 steps (11 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (9 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 22 ms. (5 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (11 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 22 ms. (5 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (11 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (11 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (11 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 120 steps (12 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (11 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (11 resets) in 8 ms. (13 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (11 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
Probabilistic random walk after 30000 steps, saw 13912 distinct states, run finished after 1031 ms. (steps per millisecond=29 ) properties seen :334
[2024-05-22 08:10:09] [INFO ] Invariant cache hit.
[2024-05-22 08:10:09] [INFO ] State equation strengthened by 1389 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s5 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s86 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s249 1.0)
(s256 1.0)
(s258 1.0)
(s260 1.0)
(s262 1.0)
(s264 1.0)
(s266 1.0)
(s268 1.0)
(s270 1.0)
(s272 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s309 1.0)
(s311 1.0)
(s314 1.0)
(s316 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s373 1.0)
(s375 1.0)
(s377 1.0)
(s379 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s418 1.0)
(s419 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s428 1.0)
(s429 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s438 1.0)
(s439 1.0)
(s443 1.0)
(s444 1.0)
(s447 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 timeout
1.0)
(s469 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 727 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s5 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)
(s86 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 timeout
1)
(s170 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 727 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 0/727 constraints, Known Traps: 0/0 constraints]
After SMT, in 16561ms problems are : Problem set: 0 solved, 727 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 746 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2279/2279 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 1075 transition count 2062
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1075 transition count 2062
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 141 place count 1075 transition count 2045
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 183 place count 1033 transition count 2003
Iterating global reduction 1 with 42 rules applied. Total rules applied 225 place count 1033 transition count 2003
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 252 place count 1006 transition count 1969
Iterating global reduction 1 with 27 rules applied. Total rules applied 279 place count 1006 transition count 1969
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 300 place count 1006 transition count 1948
Applied a total of 300 rules in 439 ms. Remains 1006 /1137 variables (removed 131) and now considering 1948/2279 (removed 331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 1006/1137 places, 1948/2279 transitions.
RANDOM walk for 2933862 steps (674234 resets) in 120004 ms. (24 steps per ms) remains 708/727 properties
BEST_FIRST walk for 4002 steps (165 resets) in 84 ms. (47 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (174 resets) in 62 ms. (63 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (162 resets) in 45 ms. (87 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (178 resets) in 51 ms. (76 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (167 resets) in 48 ms. (81 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4001 steps (177 resets) in 49 ms. (80 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (193 resets) in 52 ms. (75 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (179 resets) in 54 ms. (72 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (168 resets) in 67 ms. (58 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (174 resets) in 49 ms. (80 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (189 resets) in 52 ms. (75 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (187 resets) in 51 ms. (76 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (168 resets) in 73 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (185 resets) in 73 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (171 resets) in 69 ms. (57 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (185 resets) in 57 ms. (69 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (179 resets) in 54 ms. (72 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (184 resets) in 72 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (180 resets) in 75 ms. (52 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (168 resets) in 58 ms. (67 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (202 resets) in 69 ms. (57 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (164 resets) in 72 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (179 resets) in 63 ms. (62 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (175 resets) in 76 ms. (52 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (183 resets) in 70 ms. (56 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (193 resets) in 63 ms. (62 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (175 resets) in 69 ms. (57 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (185 resets) in 73 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (180 resets) in 68 ms. (58 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (181 resets) in 70 ms. (56 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (178 resets) in 67 ms. (58 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4002 steps (169 resets) in 69 ms. (57 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4001 steps (188 resets) in 71 ms. (55 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (185 resets) in 55 ms. (71 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (169 resets) in 72 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4001 steps (179 resets) in 76 ms. (51 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (164 resets) in 65 ms. (60 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (181 resets) in 73 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4001 steps (188 resets) in 58 ms. (67 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (188 resets) in 73 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (171 resets) in 55 ms. (71 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4000 steps (184 resets) in 58 ms. (67 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (170 resets) in 49 ms. (80 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (163 resets) in 71 ms. (55 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (166 resets) in 54 ms. (72 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (170 resets) in 71 ms. (55 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (167 resets) in 57 ms. (69 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4003 steps (194 resets) in 72 ms. (54 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4004 steps (173 resets) in 77 ms. (51 steps per ms) remains 708/708 properties
BEST_FIRST walk for 4001 steps (190 resets) in 66 ms. (59 steps per ms) remains 708/708 properties
Probabilistic random walk after 1000000 steps, saw 391159 distinct states, run finished after 17388 ms. (steps per millisecond=57 ) properties seen :686
// Phase 1: matrix 1948 rows 1006 cols
[2024-05-22 08:11:14] [INFO ] Computed 2 invariants in 18 ms
[2024-05-22 08:11:15] [INFO ] State equation strengthened by 1143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 377/405 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 274/679 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 08:11:16] [INFO ] Deduced a trap composed of 157 places in 331 ms of which 41 ms to minimize.
[2024-05-22 08:11:16] [INFO ] Deduced a trap composed of 157 places in 267 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1049/1728 variables, 679/683 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 244/927 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 08:11:18] [INFO ] Deduced a trap composed of 45 places in 338 ms of which 10 ms to minimize.
[2024-05-22 08:11:18] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 5 ms to minimize.
[2024-05-22 08:11:19] [INFO ] Deduced a trap composed of 40 places in 309 ms of which 4 ms to minimize.
[2024-05-22 08:11:19] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 4 ms to minimize.
[2024-05-22 08:11:19] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 5 ms to minimize.
[2024-05-22 08:11:20] [INFO ] Deduced a trap composed of 93 places in 278 ms of which 4 ms to minimize.
[2024-05-22 08:11:20] [INFO ] Deduced a trap composed of 93 places in 280 ms of which 4 ms to minimize.
[2024-05-22 08:11:20] [INFO ] Deduced a trap composed of 100 places in 267 ms of which 4 ms to minimize.
[2024-05-22 08:11:21] [INFO ] Deduced a trap composed of 100 places in 271 ms of which 4 ms to minimize.
[2024-05-22 08:11:21] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 4 ms to minimize.
[2024-05-22 08:11:21] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 4 ms to minimize.
[2024-05-22 08:11:22] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 4 ms to minimize.
[2024-05-22 08:11:22] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 4 ms to minimize.
[2024-05-22 08:11:22] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-05-22 08:11:23] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1728 variables, 15/942 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1728 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1168/2896 variables, 298/1240 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2896 variables, 870/2110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2896 variables, 0/2110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 58/2954 variables, 29/2139 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2954 variables, 29/2168 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2954 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 0/2954 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2954/2954 variables, and 2168 constraints, problems are : Problem set: 0 solved, 22 unsolved in 18150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1006/1006 constraints, ReadFeed: 1143/1143 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 377/405 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 274/679 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 08:11:34] [INFO ] Deduced a trap composed of 157 places in 244 ms of which 4 ms to minimize.
[2024-05-22 08:11:34] [INFO ] Deduced a trap composed of 158 places in 261 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1049/1728 variables, 679/700 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1728 variables, 244/944 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1728 variables, 11/955 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1728 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1168/2896 variables, 298/1253 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2896 variables, 870/2123 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2896 variables, 11/2134 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2896 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 58/2954 variables, 29/2163 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2954 variables, 29/2192 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2954 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2954/2954 variables, and 2192 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1006/1006 constraints, ReadFeed: 1143/1143 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 19/19 constraints]
After SMT, in 63371ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 1948/1948 transitions.
Graph (complete) has 3613 edges and 1006 vertex of which 1005 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 1005 transition count 1931
Discarding 324 places :
Symmetric choice reduction at 1 with 324 rule applications. Total rules 342 place count 681 transition count 1113
Iterating global reduction 1 with 324 rules applied. Total rules applied 666 place count 681 transition count 1113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 674 place count 681 transition count 1105
Discarding 263 places :
Symmetric choice reduction at 2 with 263 rule applications. Total rules 937 place count 418 transition count 842
Iterating global reduction 2 with 263 rules applied. Total rules applied 1200 place count 418 transition count 842
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1212 place count 418 transition count 830
Discarding 213 places :
Symmetric choice reduction at 3 with 213 rule applications. Total rules 1425 place count 205 transition count 528
Iterating global reduction 3 with 213 rules applied. Total rules applied 1638 place count 205 transition count 528
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 1836 place count 205 transition count 330
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1859 place count 182 transition count 292
Iterating global reduction 4 with 23 rules applied. Total rules applied 1882 place count 182 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1888 place count 182 transition count 286
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1903 place count 167 transition count 271
Iterating global reduction 5 with 15 rules applied. Total rules applied 1918 place count 167 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1922 place count 167 transition count 267
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1934 place count 155 transition count 255
Iterating global reduction 6 with 12 rules applied. Total rules applied 1946 place count 155 transition count 255
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1959 place count 155 transition count 242
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1965 place count 149 transition count 202
Iterating global reduction 7 with 6 rules applied. Total rules applied 1971 place count 149 transition count 202
Applied a total of 1971 rules in 150 ms. Remains 149 /1006 variables (removed 857) and now considering 202/1948 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 149/1006 places, 202/1948 transitions.
RANDOM walk for 4000000 steps (920495 resets) in 19466 ms. (205 steps per ms) remains 19/22 properties
BEST_FIRST walk for 400002 steps (18061 resets) in 793 ms. (503 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (17943 resets) in 893 ms. (447 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (17915 resets) in 759 ms. (526 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (18068 resets) in 912 ms. (438 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (17674 resets) in 804 ms. (496 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (17878 resets) in 891 ms. (448 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (17741 resets) in 875 ms. (456 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (18174 resets) in 888 ms. (449 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (38316 resets) in 1064 ms. (375 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38465 resets) in 1533 ms. (260 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38458 resets) in 1165 ms. (343 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (38438 resets) in 927 ms. (431 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (38421 resets) in 1373 ms. (291 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (38781 resets) in 1012 ms. (394 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (38315 resets) in 1079 ms. (370 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (38361 resets) in 1121 ms. (356 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (38264 resets) in 1234 ms. (323 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (38745 resets) in 1138 ms. (351 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (38376 resets) in 1205 ms. (331 steps per ms) remains 19/19 properties
// Phase 1: matrix 202 rows 149 cols
[2024-05-22 08:12:32] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 08:12:32] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 88/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 163/275 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 24/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 76/351 variables, 37/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 39/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 214 constraints, problems are : Problem set: 0 solved, 19 unsolved in 782 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 149/149 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 88/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 163/275 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 24/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 76/351 variables, 37/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 39/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 19/233 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 233 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1291 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 149/149 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 2101ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 371 ms.
Support contains 24 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 202/202 transitions.
Applied a total of 0 rules in 25 ms. Remains 149 /149 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 149/149 places, 202/202 transitions.
RANDOM walk for 4000000 steps (919377 resets) in 27307 ms. (146 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (18022 resets) in 820 ms. (487 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (17924 resets) in 848 ms. (471 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (18095 resets) in 702 ms. (568 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (18011 resets) in 853 ms. (468 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (18042 resets) in 850 ms. (470 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (18071 resets) in 658 ms. (606 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (17906 resets) in 832 ms. (480 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (17966 resets) in 850 ms. (470 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (38424 resets) in 1219 ms. (327 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (37923 resets) in 1239 ms. (322 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (38531 resets) in 1265 ms. (315 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38565 resets) in 1208 ms. (330 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38329 resets) in 1059 ms. (377 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38135 resets) in 1393 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (38372 resets) in 1426 ms. (280 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38470 resets) in 1268 ms. (315 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (38369 resets) in 1366 ms. (292 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (38353 resets) in 994 ms. (402 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (38367 resets) in 1419 ms. (281 steps per ms) remains 19/19 properties
Finished probabilistic random walk after 57268 steps, run visited all 19 properties in 518 ms. (steps per millisecond=110 )
Probabilistic random walk after 57268 steps, saw 24582 distinct states, run finished after 524 ms. (steps per millisecond=109 ) properties seen :19
Able to resolve query QuasiLiveness after proving 1134 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 270446 ms.
ITS solved all properties within timeout

BK_STOP 1716365573888

--------------------
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 QuasiLiveness -timeout 180 -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="DBSingleClientW-PT-d2m04"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DBSingleClientW-PT-d2m04, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-tall-171624200700342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m04.tgz
mv DBSingleClientW-PT-d2m04 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;