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.r490-tall-171631145000338.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 DoubleExponent-PT-003, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-171631145000338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 50K 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 1717183032975

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:17:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:17:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:17:14] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-31 19:17:14] [INFO ] Transformed 163 places.
[2024-05-31 19:17:14] [INFO ] Transformed 148 transitions.
[2024-05-31 19:17:14] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 169 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 17 ms.
RANDOM walk for 40000 steps (1331 resets) in 1923 ms. (20 steps per ms) remains 108/152 properties
BEST_FIRST walk for 400 steps (11 resets) in 44 ms. (8 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 30 ms. (12 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 21 ms. (18 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 38 ms. (10 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 22 ms. (17 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 38 ms. (10 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 30 ms. (12 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 22 ms. (17 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 39 ms. (10 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 28 ms. (13 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 28 ms. (13 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (11 resets) in 15 ms. (25 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 20 ms. (19 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 17 ms. (22 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 15 ms. (25 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 25 ms. (15 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 15 ms. (25 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (9 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (11 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 15 ms. (25 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 23 ms. (16 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
// Phase 1: matrix 148 rows 163 cols
[2024-05-31 19:17:15] [INFO ] Computed 19 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 50/158 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 5/163 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3727 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 50/158 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:17:19] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 14 ms to minimize.
[2024-05-31 19:17:19] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:17:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-31 19:17:19] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 2 ms to minimize.
[2024-05-31 19:17:20] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:17:20] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:17:20] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:17:20] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-31 19:17:20] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:17:21] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-31 19:17:21] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:17:21] [INFO ] Deduced a trap composed of 92 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:17:21] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-31 19:17:21] [INFO ] Deduced a trap composed of 93 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:17:21] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 5/163 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:17:22] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-31 19:17:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 19:17:22] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 2 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 2 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-31 19:17:23] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:17:24] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:17:24] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-31 19:17:24] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 8851ms, After SMT, problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 163 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 154 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 154 transition count 137
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 152 transition count 137
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 138 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 136 transition count 123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 136 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 135 transition count 122
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 135 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 134 transition count 121
Applied a total of 60 rules in 48 ms. Remains 134 /163 variables (removed 29) and now considering 121/148 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 134/163 places, 121/148 transitions.
RANDOM walk for 4000000 steps (509928 resets) in 23178 ms. (172 steps per ms) remains 70/108 properties
BEST_FIRST walk for 400003 steps (33655 resets) in 1480 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33557 resets) in 1454 ms. (274 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33514 resets) in 1478 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33797 resets) in 1476 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33717 resets) in 1504 ms. (265 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33731 resets) in 1496 ms. (267 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33667 resets) in 1513 ms. (264 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33767 resets) in 1495 ms. (267 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33730 resets) in 1510 ms. (264 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33650 resets) in 1526 ms. (261 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33703 resets) in 1515 ms. (263 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33943 resets) in 1454 ms. (274 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33644 resets) in 1445 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33802 resets) in 1495 ms. (267 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33770 resets) in 1477 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33864 resets) in 1419 ms. (281 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33673 resets) in 1469 ms. (272 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33794 resets) in 1508 ms. (265 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33768 resets) in 1469 ms. (272 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33838 resets) in 1928 ms. (207 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (33724 resets) in 1799 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33790 resets) in 1461 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33753 resets) in 1833 ms. (218 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33807 resets) in 1801 ms. (221 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33789 resets) in 1814 ms. (220 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33847 resets) in 1902 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33637 resets) in 1688 ms. (236 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33757 resets) in 1542 ms. (259 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33518 resets) in 1488 ms. (268 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33836 resets) in 1494 ms. (267 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33631 resets) in 1452 ms. (275 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33962 resets) in 1479 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33866 resets) in 1527 ms. (261 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33769 resets) in 1541 ms. (259 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33941 resets) in 1415 ms. (282 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33558 resets) in 1447 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33944 resets) in 1416 ms. (282 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33905 resets) in 1381 ms. (289 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33852 resets) in 1370 ms. (291 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33841 resets) in 1388 ms. (287 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33870 resets) in 1429 ms. (279 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33794 resets) in 1410 ms. (283 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33860 resets) in 1378 ms. (290 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33931 resets) in 1375 ms. (290 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33687 resets) in 1396 ms. (286 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33906 resets) in 1386 ms. (288 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33749 resets) in 1428 ms. (279 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33831 resets) in 1429 ms. (279 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33654 resets) in 1355 ms. (294 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33959 resets) in 1370 ms. (291 steps per ms) remains 70/70 properties
// Phase 1: matrix 121 rows 134 cols
[2024-05-31 19:17:55] [INFO ] Computed 19 invariants in 4 ms
[2024-05-31 19:17:55] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 46/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 14/134 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 121/255 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1756 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 46/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 14/134 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 4 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:17:58] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-31 19:17:59] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:17:59] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 121/255 variables, 134/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 70/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 15 (OVERLAPS) 0/255 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 25/25 constraints]
After SMT, in 6600ms problems are : Problem set: 0 solved, 70 unsolved
Fused 70 Parikh solutions to 67 different solutions.
Parikh walk visited 0 properties in 7553 ms.
Support contains 70 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 121/121 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 134 transition count 113
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 126 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 126 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 125 transition count 112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 117 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 116 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 116 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 115 transition count 103
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 115 transition count 103
Applied a total of 42 rules in 18 ms. Remains 115 /134 variables (removed 19) and now considering 103/121 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 115/134 places, 103/121 transitions.
RANDOM walk for 4000000 steps (512873 resets) in 21441 ms. (186 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33753 resets) in 1500 ms. (266 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33865 resets) in 1502 ms. (266 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34061 resets) in 1489 ms. (268 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33860 resets) in 1507 ms. (265 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33845 resets) in 1476 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33752 resets) in 1403 ms. (284 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33961 resets) in 1643 ms. (243 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33991 resets) in 1445 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33844 resets) in 1449 ms. (275 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33949 resets) in 1446 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33815 resets) in 1390 ms. (287 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33990 resets) in 1406 ms. (284 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33864 resets) in 1422 ms. (281 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33898 resets) in 1487 ms. (268 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33961 resets) in 1465 ms. (272 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (34024 resets) in 1427 ms. (280 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33875 resets) in 1480 ms. (270 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33921 resets) in 1461 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33786 resets) in 1447 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33885 resets) in 1464 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33824 resets) in 2435 ms. (164 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33901 resets) in 1435 ms. (278 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33859 resets) in 1441 ms. (277 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (34037 resets) in 1446 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (33946 resets) in 1485 ms. (269 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33715 resets) in 1427 ms. (280 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33934 resets) in 1411 ms. (283 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33832 resets) in 1395 ms. (286 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (34035 resets) in 1367 ms. (292 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (34031 resets) in 1392 ms. (287 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33878 resets) in 1462 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33929 resets) in 1430 ms. (279 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33800 resets) in 1410 ms. (283 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34092 resets) in 1421 ms. (281 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33839 resets) in 1440 ms. (277 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33840 resets) in 1433 ms. (278 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33996 resets) in 1410 ms. (283 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33906 resets) in 1740 ms. (229 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34015 resets) in 1721 ms. (232 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33769 resets) in 1740 ms. (229 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (33746 resets) in 1921 ms. (208 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33908 resets) in 1452 ms. (275 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33831 resets) in 1431 ms. (279 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33821 resets) in 1425 ms. (280 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (34011 resets) in 1860 ms. (214 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33813 resets) in 1465 ms. (272 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33818 resets) in 1579 ms. (253 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33905 resets) in 1629 ms. (245 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33926 resets) in 1837 ms. (217 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (34161 resets) in 1779 ms. (224 steps per ms) remains 70/70 properties
Finished probabilistic random walk after 1960796 steps, run visited all 70 properties in 9801 ms. (steps per millisecond=200 )
Probabilistic random walk after 1960796 steps, saw 980563 distinct states, run finished after 9814 ms. (steps per millisecond=199 ) properties seen :70
Able to resolve query StableMarking after proving 153 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 94522 ms.
ITS solved all properties within timeout

BK_STOP 1717183128693

--------------------
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r490-tall-171631145000338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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