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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 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 33K 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 1717183021245

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-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:17:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:17:02] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 19:17:02] [INFO ] Transformed 110 places.
[2024-05-31 19:17:02] [INFO ] Transformed 98 transitions.
[2024-05-31 19:17:02] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 175 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 7 ms.
RANDOM walk for 40000 steps (1318 resets) in 1795 ms. (22 steps per ms) remains 55/99 properties
BEST_FIRST walk for 4000 steps (118 resets) in 223 ms. (17 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (112 resets) in 238 ms. (16 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (115 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (116 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (112 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (115 resets) in 51 ms. (76 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (101 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (123 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (113 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (114 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (111 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (110 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (110 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (113 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (110 resets) in 52 ms. (75 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (107 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (110 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (108 resets) in 23 ms. (166 steps per ms) remains 28/55 properties
BEST_FIRST walk for 4001 steps (106 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (115 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (112 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (116 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (118 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (116 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (109 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (114 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (115 resets) in 51 ms. (76 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (106 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (111 resets) in 28 ms. (137 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (106 resets) in 25 ms. (153 steps per ms) remains 19/28 properties
// Phase 1: matrix 98 rows 110 cols
[2024-05-31 19:17:04] [INFO ] Computed 14 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 74/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 4/97 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 13/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 98/208 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 124 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 74/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 19:17:05] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4/97 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 13/110 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 15 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 2 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 19:17:06] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 98/208 variables, 110/135 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 19/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 19:17:07] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:17:07] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 13/13 constraints]
After SMT, in 4470ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1316 ms.
Support contains 19 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 107 transition count 78
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 87 transition count 78
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 41 place count 87 transition count 75
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 84 transition count 75
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 85 place count 65 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 63 transition count 56
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 63 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 61 transition count 54
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 60 transition count 53
Applied a total of 100 rules in 62 ms. Remains 60 /110 variables (removed 50) and now considering 53/98 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 60/110 places, 53/98 transitions.
RANDOM walk for 4000000 steps (512689 resets) in 20481 ms. (195 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400002 steps (33881 resets) in 1030 ms. (387 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (33900 resets) in 1032 ms. (387 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33667 resets) in 1029 ms. (388 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33931 resets) in 1041 ms. (383 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33969 resets) in 1051 ms. (380 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (33939 resets) in 996 ms. (401 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33720 resets) in 970 ms. (411 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33894 resets) in 993 ms. (402 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33873 resets) in 971 ms. (411 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33918 resets) in 989 ms. (404 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33991 resets) in 1041 ms. (383 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33931 resets) in 1055 ms. (378 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33864 resets) in 1064 ms. (375 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (33914 resets) in 1029 ms. (388 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (33855 resets) in 1029 ms. (388 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33816 resets) in 1040 ms. (384 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (34015 resets) in 1005 ms. (397 steps per ms) remains 17/17 properties
// Phase 1: matrix 53 rows 60 cols
[2024-05-31 19:17:25] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:17:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 37/54 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/56 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 53/109 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 4/113 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 76 constraints, problems are : Problem set: 0 solved, 17 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 60/60 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 37/54 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 19:17:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-31 19:17:25] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:17:25] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 19:17:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 53/109 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 19:17:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-31 19:17:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 4/113 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/113 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/113 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 99 constraints, problems are : Problem set: 0 solved, 17 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 60/60 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 6/6 constraints]
After SMT, in 956ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 416 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 53/53 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 52
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 52
Applied a total of 3 rules in 6 ms. Remains 59 /60 variables (removed 1) and now considering 52/53 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 59/60 places, 52/53 transitions.
RANDOM walk for 4000000 steps (513117 resets) in 16133 ms. (247 steps per ms) remains 5/17 properties
BEST_FIRST walk for 4000002 steps (338267 resets) in 4523 ms. (884 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (339187 resets) in 4505 ms. (887 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000000 steps (339673 resets) in 4313 ms. (927 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (339577 resets) in 4112 ms. (972 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (338621 resets) in 4100 ms. (975 steps per ms) remains 5/5 properties
// Phase 1: matrix 52 rows 59 cols
[2024-05-31 19:17:40] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 19:17:40] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 33/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 52/107 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/111 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 75 constraints, problems are : Problem set: 0 solved, 5 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 33/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:17:40] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:17:40] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-31 19:17:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-31 19:17:40] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-31 19:17:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-31 19:17:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-31 19:17:41] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-31 19:17:41] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/55 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 52/107 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/111 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/111 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/111 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 88 constraints, problems are : Problem set: 0 solved, 5 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 602 ms.
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 52/52 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 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 57 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 57 transition count 49
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 6 place count 56 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 10 place count 54 transition count 47
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 54 transition count 44
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 51 transition count 44
Applied a total of 16 rules in 9 ms. Remains 51 /59 variables (removed 8) and now considering 44/52 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 51/59 places, 44/52 transitions.
RANDOM walk for 4000000 steps (512924 resets) in 6040 ms. (662 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (339238 resets) in 4498 ms. (889 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (338621 resets) in 4238 ms. (943 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (339436 resets) in 4432 ms. (902 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (339064 resets) in 5118 ms. (781 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (339715 resets) in 4203 ms. (951 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 1992 steps, run visited all 5 properties in 20 ms. (steps per millisecond=99 )
Probabilistic random walk after 1992 steps, saw 1026 distinct states, run finished after 24 ms. (steps per millisecond=83 ) properties seen :5
Able to resolve query StableMarking after proving 100 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 48638 ms.
ITS solved all properties within timeout

BK_STOP 1717183071140

--------------------
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-002"
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-002, 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-171631144900333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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