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.r482-tall-171624201200088.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 ltsminxred
Input is CloudReconfiguration-PT-304, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201200088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 4.0K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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 1717178392154

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-304
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:59:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 17:59:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:59:53] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-05-31 17:59:53] [INFO ] Transformed 2584 places.
[2024-05-31 17:59:53] [INFO ] Transformed 3094 transitions.
[2024-05-31 17:59:53] [INFO ] Found NUPN structural information;
[2024-05-31 17:59:53] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 298 ms.
Graph (trivial) has 2956 edges and 2584 vertex of which 882 / 2584 are part of one of the 63 SCC in 12 ms
Free SCC test removed 819 places
Structural test allowed to assert that 867 places are NOT stable. Took 48 ms.
Ensure Unique test removed 936 transitions
Reduce redundant transitions removed 936 transitions.
RANDOM walk for 40000 steps (649 resets) in 5222 ms. (7 steps per ms) remains 1287/1717 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 29 ms. (4 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 93 ms. (1 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1287/1287 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1287/1287 properties
[2024-05-31 17:59:55] [INFO ] Flow matrix only has 2096 transitions (discarded 62 similar events)
// Phase 1: matrix 2096 rows 1765 cols
[2024-05-31 17:59:56] [INFO ] Computed 4 invariants in 36 ms
[2024-05-31 17:59:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1287 variables, 1287/1287 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1287/3861 variables, and 1287 constraints, problems are : Problem set: 0 solved, 1287 unsolved in 5141 ms.
Refiners :[Domain max(s): 1287/1765 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1765 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1287/1287 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1287 variables, 1287/1287 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1287/3861 variables, and 1287 constraints, problems are : Problem set: 0 solved, 1287 unsolved in 5037 ms.
Refiners :[Domain max(s): 1287/1765 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1765 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1287 constraints, Known Traps: 0/0 constraints]
After SMT, in 10936ms problems are : Problem set: 0 solved, 1287 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1287 out of 1765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1765/1765 places, 2158/2158 transitions.
Graph (complete) has 2372 edges and 1765 vertex of which 1752 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.10 ms
Discarding 13 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 377 rules applied. Total rules applied 378 place count 1752 transition count 1772
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 1 with 323 rules applied. Total rules applied 701 place count 1446 transition count 1755
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 704 place count 1444 transition count 1754
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 704 place count 1444 transition count 1739
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 734 place count 1429 transition count 1739
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 755 place count 1408 transition count 1718
Iterating global reduction 3 with 21 rules applied. Total rules applied 776 place count 1408 transition count 1718
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 779 place count 1405 transition count 1715
Iterating global reduction 3 with 3 rules applied. Total rules applied 782 place count 1405 transition count 1715
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 784 place count 1403 transition count 1713
Iterating global reduction 3 with 2 rules applied. Total rules applied 786 place count 1403 transition count 1713
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 788 place count 1403 transition count 1711
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 850 place count 1372 transition count 1680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 851 place count 1372 transition count 1679
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 863 place count 1366 transition count 1702
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 877 place count 1366 transition count 1688
Free-agglomeration rule applied 24 times.
Iterating global reduction 5 with 24 rules applied. Total rules applied 901 place count 1366 transition count 1664
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 928 place count 1342 transition count 1661
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 931 place count 1342 transition count 1658
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 943 place count 1342 transition count 1658
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 950 place count 1342 transition count 1658
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 954 place count 1342 transition count 1654
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 955 place count 1341 transition count 1653
Applied a total of 955 rules in 759 ms. Remains 1341 /1765 variables (removed 424) and now considering 1653/2158 (removed 505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 1341/1765 places, 1653/2158 transitions.
RANDOM walk for 4000000 steps (56913 resets) in 93027 ms. (42 steps per ms) remains 38/1287 properties
BEST_FIRST walk for 400003 steps (1653 resets) in 1264 ms. (316 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (1562 resets) in 781 ms. (511 steps per ms) remains 35/38 properties
BEST_FIRST walk for 400001 steps (1627 resets) in 663 ms. (602 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1623 resets) in 733 ms. (544 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400000 steps (1641 resets) in 864 ms. (462 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1596 resets) in 1050 ms. (380 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1617 resets) in 857 ms. (466 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1606 resets) in 1324 ms. (301 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400001 steps (1657 resets) in 902 ms. (442 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1663 resets) in 1088 ms. (367 steps per ms) remains 19/35 properties
BEST_FIRST walk for 400003 steps (1614 resets) in 1244 ms. (321 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (1628 resets) in 1110 ms. (360 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (1633 resets) in 939 ms. (425 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (1631 resets) in 899 ms. (444 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400003 steps (1625 resets) in 615 ms. (649 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (1634 resets) in 579 ms. (689 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (1653 resets) in 576 ms. (693 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (1601 resets) in 581 ms. (687 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (1675 resets) in 598 ms. (667 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (1600 resets) in 600 ms. (665 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (1651 resets) in 599 ms. (666 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (1622 resets) in 601 ms. (664 steps per ms) remains 10/17 properties
[2024-05-31 18:00:41] [INFO ] Flow matrix only has 1651 transitions (discarded 2 similar events)
// Phase 1: matrix 1651 rows 1341 cols
[2024-05-31 18:00:41] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 18:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 508/920 variables, 412/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 127/1047 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1047 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 460/1507 variables, 179/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1507 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1507 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 675/2182 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2182 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2182 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 726/2908 variables, 698/1302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2908 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 23/2931 variables, 12/1314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2931 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 13/2944 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2944 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 7/2951 variables, 4/1325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2951 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 8/2959 variables, 3/1328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2959 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 9/2968 variables, 5/1333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2968 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 8/2976 variables, 3/1336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2976 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 9/2985 variables, 5/1341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2985 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 4/2989 variables, 2/1343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2989 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 3/2992 variables, 2/1345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2992 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 0/2992 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2992/2992 variables, and 1345 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5566 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 1341/1341 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 508/920 variables, 412/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/920 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 127/1047 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1047 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1047 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 460/1507 variables, 179/606 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1507 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1507 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 675/2182 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2182 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2182 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 726/2908 variables, 698/1312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2908 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 23/2931 variables, 12/1324 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2931 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 13/2944 variables, 7/1331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2944 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 7/2951 variables, 4/1335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2951 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 8/2959 variables, 3/1338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2959 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 9/2968 variables, 5/1343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2968 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 8/2976 variables, 3/1346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2976 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 9/2985 variables, 5/1351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2985 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 4/2989 variables, 2/1353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2989 variables, 0/1353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 3/2992 variables, 2/1355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2992 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 0/2992 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2992/2992 variables, and 1355 constraints, problems are : Problem set: 0 solved, 10 unsolved in 8190 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 1341/1341 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 13802ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 143 steps, including 2 resets, run visited all 10 properties in 3 ms. (steps per millisecond=47 )
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 10 properties in 25 ms.
Able to resolve query StableMarking after proving 1719 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 61745 ms.
ITS solved all properties within timeout

BK_STOP 1717178455087

--------------------
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 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-304"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudReconfiguration-PT-304, 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 r482-tall-171624201200088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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