Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r056-tall-174854041700178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is CloudReconfiguration-PT-310, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854041700178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 660K May 29 14:32 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 1748648238112

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-310
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:37:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-30 23:37:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:37:19] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-05-30 23:37:19] [INFO ] Transformed 2585 places.
[2025-05-30 23:37:19] [INFO ] Transformed 3095 transitions.
[2025-05-30 23:37:19] [INFO ] Found NUPN structural information;
[2025-05-30 23:37:19] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 257 ms.
Graph (trivial) has 2956 edges and 2585 vertex of which 882 / 2585 are part of one of the 63 SCC in 13 ms
Free SCC test removed 819 places
Structural test allowed to assert that 867 places are NOT stable. Took 54 ms.
Ensure Unique test removed 936 transitions
Reduce redundant transitions removed 936 transitions.
RANDOM walk for 40000 steps (721 resets) in 3906 ms. (10 steps per ms) remains 1375/1718 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 77 ms. (1 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 38 ms. (3 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 23 ms. (5 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 24 ms. (4 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1375/1375 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1375/1375 properties
[2025-05-30 23:37:21] [INFO ] Flow matrix only has 2097 transitions (discarded 62 similar events)
// Phase 1: matrix 2097 rows 1766 cols
[2025-05-30 23:37:21] [INFO ] Computed 4 invariants in 42 ms
[2025-05-30 23:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1375 variables, 1375/1375 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1375/3863 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 5111 ms.
Refiners :[Domain max(s): 1375/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1375 variables, 1375/1375 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1375/3863 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 5026 ms.
Refiners :[Domain max(s): 1375/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1375 constraints, Known Traps: 0/0 constraints]
After SMT, in 10665ms problems are : Problem set: 0 solved, 1375 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1375 out of 1766 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1766/1766 places, 2159/2159 transitions.
Graph (complete) has 2375 edges and 1766 vertex of which 1752 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 1752 transition count 1836
Reduce places removed 241 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 258 rules applied. Total rules applied 572 place count 1511 transition count 1819
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 577 place count 1507 transition count 1818
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 577 place count 1507 transition count 1805
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 603 place count 1494 transition count 1805
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 619 place count 1478 transition count 1789
Iterating global reduction 3 with 16 rules applied. Total rules applied 635 place count 1478 transition count 1789
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 691 place count 1450 transition count 1760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 692 place count 1450 transition count 1759
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 702 place count 1445 transition count 1792
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 710 place count 1445 transition count 1784
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 731 place count 1445 transition count 1763
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 755 place count 1424 transition count 1760
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 760 place count 1424 transition count 1755
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 764 place count 1424 transition count 1755
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 768 place count 1424 transition count 1755
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 772 place count 1424 transition count 1751
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 773 place count 1423 transition count 1750
Applied a total of 773 rules in 371 ms. Remains 1423 /1766 variables (removed 343) and now considering 1750/2159 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 1423/1766 places, 1750/2159 transitions.
RANDOM walk for 4000000 steps (14628 resets) in 99277 ms. (40 steps per ms) remains 82/1375 properties
BEST_FIRST walk for 400002 steps (462 resets) in 1522 ms. (262 steps per ms) remains 78/82 properties
BEST_FIRST walk for 400003 steps (462 resets) in 939 ms. (425 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (457 resets) in 942 ms. (424 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (459 resets) in 1480 ms. (270 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (461 resets) in 932 ms. (428 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (456 resets) in 963 ms. (414 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (462 resets) in 935 ms. (427 steps per ms) remains 74/78 properties
BEST_FIRST walk for 400002 steps (452 resets) in 932 ms. (428 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (461 resets) in 926 ms. (431 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (473 resets) in 927 ms. (431 steps per ms) remains 66/74 properties
BEST_FIRST walk for 400002 steps (468 resets) in 889 ms. (449 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (454 resets) in 870 ms. (459 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (459 resets) in 853 ms. (468 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (446 resets) in 861 ms. (464 steps per ms) remains 56/66 properties
BEST_FIRST walk for 400000 steps (459 resets) in 806 ms. (495 steps per ms) remains 54/56 properties
BEST_FIRST walk for 400003 steps (467 resets) in 810 ms. (493 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (467 resets) in 807 ms. (495 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (460 resets) in 810 ms. (493 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (450 resets) in 827 ms. (483 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (460 resets) in 809 ms. (493 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (458 resets) in 803 ms. (497 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400000 steps (465 resets) in 802 ms. (498 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (452 resets) in 799 ms. (500 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (452 resets) in 804 ms. (496 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (449 resets) in 800 ms. (499 steps per ms) remains 52/54 properties
BEST_FIRST walk for 400003 steps (469 resets) in 782 ms. (510 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (458 resets) in 785 ms. (508 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (450 resets) in 783 ms. (510 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (472 resets) in 784 ms. (509 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (465 resets) in 786 ms. (508 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (439 resets) in 788 ms. (506 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (463 resets) in 782 ms. (510 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (459 resets) in 789 ms. (506 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (458 resets) in 794 ms. (503 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (471 resets) in 780 ms. (512 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (439 resets) in 771 ms. (518 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (474 resets) in 775 ms. (515 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (438 resets) in 780 ms. (512 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (468 resets) in 780 ms. (512 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (443 resets) in 783 ms. (510 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (464 resets) in 781 ms. (511 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (460 resets) in 774 ms. (516 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (471 resets) in 802 ms. (498 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (468 resets) in 786 ms. (508 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (475 resets) in 781 ms. (511 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (451 resets) in 774 ms. (516 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (459 resets) in 795 ms. (502 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (476 resets) in 797 ms. (501 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (446 resets) in 769 ms. (519 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (437 resets) in 775 ms. (515 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (463 resets) in 781 ms. (511 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (461 resets) in 800 ms. (499 steps per ms) remains 52/52 properties
[2025-05-30 23:38:12] [INFO ] Flow matrix only has 1749 transitions (discarded 1 similar events)
// Phase 1: matrix 1749 rows 1423 cols
[2025-05-30 23:38:12] [INFO ] Computed 4 invariants in 13 ms
[2025-05-30 23:38:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 398/450 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 549/999 variables, 450/451 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 140/1139 variables, 5/456 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 141/1280 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1280 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 536/1816 variables, 300/758 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1816 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1816 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 666/2482 variables, 2/761 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2482 variables, 5/766 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2482 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 16 (OVERLAPS) 690/3172 variables, 662/1428 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3172 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 18 (OVERLAPS) 0/3172 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3172/3172 variables, and 1428 constraints, problems are : Problem set: 0 solved, 52 unsolved in 12049 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 1423/1423 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 398/450 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 549/999 variables, 450/451 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 39/490 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 140/1139 variables, 5/495 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 13/508 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2025-05-30 23:38:26] [INFO ] Deduced a trap composed of 399 places in 243 ms of which 85 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1139 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 141/1280 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1280 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 536/1816 variables, 300/811 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1816 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1816 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 16 (OVERLAPS) 666/2482 variables, 2/814 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2482 variables, 5/819 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2482 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem smplace_325 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT BESTFIRST_WALK TOPOLOGICAL
SMT process timed out in 26222ms, After SMT, problems are : Problem set: 0 solved, 52 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 1423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1423/1423 places, 1750/1750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 915 transitions
Trivial Post-agglo rules discarded 915 transitions
Performed 915 trivial Post agglomeration. Transition count delta: 915
Iterating post reduction 0 with 915 rules applied. Total rules applied 915 place count 1423 transition count 835
Reduce places removed 915 places and 0 transitions.
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 1020 rules applied. Total rules applied 1935 place count 508 transition count 730
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 53 rules applied. Total rules applied 1988 place count 462 transition count 723
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 4 rules applied. Total rules applied 1992 place count 461 transition count 720
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1995 place count 459 transition count 719
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 1995 place count 459 transition count 696
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 2041 place count 436 transition count 696
Discarding 60 places :
Symmetric choice reduction at 5 with 60 rule applications. Total rules 2101 place count 376 transition count 624
Iterating global reduction 5 with 60 rules applied. Total rules applied 2161 place count 376 transition count 624
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2161 place count 376 transition count 622
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2165 place count 374 transition count 622
Discarding 55 places :
Symmetric choice reduction at 5 with 55 rule applications. Total rules 2220 place count 319 transition count 567
Iterating global reduction 5 with 55 rules applied. Total rules applied 2275 place count 319 transition count 567
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 37 rules applied. Total rules applied 2312 place count 319 transition count 530
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 30 rules applied. Total rules applied 2342 place count 301 transition count 518
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2348 place count 295 transition count 518
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2365 place count 278 transition count 488
Iterating global reduction 8 with 17 rules applied. Total rules applied 2382 place count 278 transition count 488
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 2395 place count 278 transition count 475
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2401 place count 272 transition count 463
Iterating global reduction 9 with 6 rules applied. Total rules applied 2407 place count 272 transition count 463
Performed 116 Post agglomeration using F-continuation condition with reduction of 62 identical transitions.
Deduced a syphon composed of 116 places in 1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2182.t2183.t2184.t2185.t2186.t2187.t2188.t2189.t3023.t2630.t2631.t2632.t2633.t2634.t2635.t2636.t2637.t2013 and 1 places that fell out of Prefix Of Interest.
Iterating global reduction 9 with 117 rules applied. Total rules applied 2524 place count 154 transition count 284
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2182.t2183.t2184.t2185.t2186.t2187.t2188.t2189.t3025.t2630.t2631.t2632.t2633.t2634.t2635.t2636.t2637.t1946 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 153 vertex of which 93 / 153 are part of one of the 8 SCC in 0 ms
Free SCC test removed 85 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 2540 place count 68 transition count 269
Drop transitions (Empty/Sink Transition effects.) removed 176 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 187 transitions.
Iterating post reduction 10 with 187 rules applied. Total rules applied 2727 place count 68 transition count 82
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 2729 place count 66 transition count 80
Iterating global reduction 11 with 2 rules applied. Total rules applied 2731 place count 66 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2737 place count 63 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2743 place count 63 transition count 71
Applied a total of 2743 rules in 102 ms. Remains 63 /1423 variables (removed 1360) and now considering 71/1750 (removed 1679) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 63/1423 places, 71/1750 transitions.
Total runtime 79109 ms.
ITS solved all properties within timeout

BK_STOP 1748648318764

--------------------
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-310"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CloudReconfiguration-PT-310, 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 r056-tall-174854041700178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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