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-171624200300133.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 CloudReconfiguration-PT-313, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200300133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 19:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 19:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1716364269247

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-313
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:51:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 07:51:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:51:10] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-22 07:51:10] [INFO ] Transformed 2585 places.
[2024-05-22 07:51:10] [INFO ] Transformed 3095 transitions.
[2024-05-22 07:51:10] [INFO ] Found NUPN structural information;
[2024-05-22 07:51:10] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 262 ms.
Graph (trivial) has 2956 edges and 2585 vertex of which 882 / 2585 are part of one of the 63 SCC in 11 ms
Free SCC test removed 819 places
Structural test allowed to assert that 867 places are NOT stable. Took 44 ms.
Ensure Unique test removed 936 transitions
Reduce redundant transitions removed 936 transitions.
RANDOM walk for 40000 steps (644 resets) in 3941 ms. (10 steps per ms) remains 1260/1718 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 36 ms. (3 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1260/1260 properties
[2024-05-22 07:51:12] [INFO ] Flow matrix only has 2097 transitions (discarded 62 similar events)
// Phase 1: matrix 2097 rows 1766 cols
[2024-05-22 07:51:12] [INFO ] Computed 4 invariants in 34 ms
[2024-05-22 07:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1260 variables, 1260/1260 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1260/3863 variables, and 1260 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 5112 ms.
Refiners :[Domain max(s): 1260/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1260/1260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1260 variables, 1260/1260 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
Error getting values : (error "ParserException while parsing response: ((s52 1)
(s53 1)
(s54 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)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s140 1)
(s141 1)
(s142 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s156 1)
(s162 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s232 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s252 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s314 1)
(s315 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 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)
(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)
(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)
(s445 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)
(s527 1)
(s530 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)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1260/3863 variables, and 1260 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 5027 ms.
Refiners :[Domain max(s): 1260/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1260 constraints, Known Traps: 0/0 constraints]
After SMT, in 10601ms problems are : Problem set: 0 solved, 1260 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1260 out of 1766 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1766/1766 places, 2159/2159 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 1766 transition count 1770
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 353 rules applied. Total rules applied 742 place count 1440 transition count 1743
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 748 place count 1434 transition count 1743
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 748 place count 1434 transition count 1728
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 778 place count 1419 transition count 1728
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 797 place count 1400 transition count 1709
Iterating global reduction 3 with 19 rules applied. Total rules applied 816 place count 1400 transition count 1709
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 819 place count 1397 transition count 1706
Iterating global reduction 3 with 3 rules applied. Total rules applied 822 place count 1397 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 823 place count 1396 transition count 1705
Iterating global reduction 3 with 1 rules applied. Total rules applied 824 place count 1396 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 825 place count 1396 transition count 1704
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 897 place count 1360 transition count 1667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 898 place count 1360 transition count 1666
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 910 place count 1354 transition count 1697
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 923 place count 1354 transition count 1684
Free-agglomeration rule applied 33 times.
Iterating global reduction 5 with 33 rules applied. Total rules applied 956 place count 1354 transition count 1651
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 991 place count 1321 transition count 1649
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 997 place count 1321 transition count 1643
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 998 place count 1321 transition count 1642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 999 place count 1320 transition count 1642
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1000 place count 1320 transition count 1642
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1003 place count 1320 transition count 1642
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1004 place count 1320 transition count 1641
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1005 place count 1319 transition count 1640
Applied a total of 1005 rules in 391 ms. Remains 1319 /1766 variables (removed 447) and now considering 1640/2159 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 1319/1766 places, 1640/2159 transitions.
RANDOM walk for 4000000 steps (16800 resets) in 72303 ms. (55 steps per ms) remains 22/1260 properties
BEST_FIRST walk for 400004 steps (461 resets) in 1118 ms. (357 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (469 resets) in 622 ms. (642 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (461 resets) in 588 ms. (679 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (482 resets) in 616 ms. (648 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (479 resets) in 614 ms. (650 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (465 resets) in 604 ms. (661 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (470 resets) in 613 ms. (651 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (473 resets) in 598 ms. (667 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (478 resets) in 596 ms. (670 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (490 resets) in 589 ms. (677 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (490 resets) in 601 ms. (664 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (470 resets) in 586 ms. (681 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (496 resets) in 600 ms. (665 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (459 resets) in 575 ms. (694 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (495 resets) in 596 ms. (670 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (464 resets) in 596 ms. (670 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (482 resets) in 596 ms. (670 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (486 resets) in 590 ms. (676 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (477 resets) in 585 ms. (682 steps per ms) remains 14/22 properties
BEST_FIRST walk for 400004 steps (478 resets) in 453 ms. (881 steps per ms) remains 12/14 properties
[2024-05-22 07:51:46] [INFO ] Flow matrix only has 1638 transitions (discarded 2 similar events)
// Phase 1: matrix 1638 rows 1319 cols
[2024-05-22 07:51:46] [INFO ] Computed 4 invariants in 9 ms
[2024-05-22 07:51:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 392/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 915/1319 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1638/2957 variables, 1319/1323 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2957 variables, 1/1324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2957 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/2957 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2957/2957 variables, and 1324 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1760 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1319/1319 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 392/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 915/1319 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1638/2957 variables, 1319/1323 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2957 variables, 1/1324 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2957 variables, 12/1336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2957 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/2957 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2957/2957 variables, and 1336 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2591 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1319/1319 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 4377ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 12 properties in 2 ms. (steps per millisecond=11 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 20 ms.
Able to resolve query StableMarking after proving 1720 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 40982 ms.
ITS solved all properties within timeout

BK_STOP 1716364311378

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="CloudReconfiguration-PT-313"
export BK_EXAMINATION="StableMarking"
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 CloudReconfiguration-PT-313, examination is StableMarking"
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-171624200300133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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