About the Execution of 2024-gold for DoubleExponent-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15688.410 | 69190.00 | 241985.00 | 172.00 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080300293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is DoubleExponent-PT-002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080300293
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 33K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1748736204809
Invoking MCC driver with
BK_TOOL=gold2024
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 greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:03:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 00:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:03:26] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2025-06-01 00:03:26] [INFO ] Transformed 110 places.
[2025-06-01 00:03:26] [INFO ] Transformed 98 transitions.
[2025-06-01 00:03:26] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 166 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 8 ms.
RANDOM walk for 40000 steps (1338 resets) in 1820 ms. (21 steps per ms) remains 55/99 properties
BEST_FIRST walk for 4000 steps (109 resets) in 74 ms. (53 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (112 resets) in 175 ms. (22 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (112 resets) in 67 ms. (58 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (117 resets) in 83 ms. (47 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (112 resets) in 56 ms. (70 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (113 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (110 resets) in 39 ms. (100 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (111 resets) in 54 ms. (72 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (103 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (107 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (106 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (105 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (114 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (116 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (114 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (114 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (115 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (111 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (109 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (113 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (111 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (115 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (115 resets) in 29 ms. (133 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 4000 steps (115 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (113 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (110 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (117 resets) in 47 ms. (83 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (111 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (119 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (115 resets) in 42 ms. (93 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (108 resets) in 56 ms. (70 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (105 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (110 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (112 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (113 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (108 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (116 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (114 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (113 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (107 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (110 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (113 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (113 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (103 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (120 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (110 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (111 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (107 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
// Phase 1: matrix 98 rows 110 cols
[2025-06-01 00:03:27] [INFO ] Computed 14 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/105 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 5/110 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 98/208 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 124 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/105 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 00:03:29] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 13 ms to minimize.
[2025-06-01 00:03:29] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:03:29] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 5/110 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 2 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:03:30] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:03:31] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 98/208 variables, 110/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 55/191 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 00:03:31] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-06-01 00:03:31] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 193 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3607 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 14/14 constraints]
After SMT, in 5126ms problems are : Problem set: 0 solved, 55 unsolved
Fused 55 Parikh solutions to 49 different solutions.
Parikh walk visited 0 properties in 1415 ms.
Support contains 55 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 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 110 transition count 89
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 101 transition count 89
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 101 transition count 87
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 99 transition count 87
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 85 transition count 73
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 83 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 83 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 82 transition count 72
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 82 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 81 transition count 71
Applied a total of 60 rules in 66 ms. Remains 81 /110 variables (removed 29) and now considering 71/98 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 81/110 places, 71/98 transitions.
RANDOM walk for 4000000 steps (509883 resets) in 20819 ms. (192 steps per ms) remains 17/55 properties
BEST_FIRST walk for 400003 steps (33800 resets) in 1502 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33858 resets) in 1646 ms. (242 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (33840 resets) in 1193 ms. (335 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33941 resets) in 1242 ms. (321 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33736 resets) in 1203 ms. (332 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (33645 resets) in 1199 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33500 resets) in 1206 ms. (331 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33864 resets) in 1189 ms. (336 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (34126 resets) in 1183 ms. (337 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33652 resets) in 1193 ms. (335 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33774 resets) in 1183 ms. (337 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (33794 resets) in 1184 ms. (337 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (33721 resets) in 1192 ms. (335 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33832 resets) in 1182 ms. (338 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33752 resets) in 1188 ms. (336 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (33632 resets) in 1167 ms. (342 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (33868 resets) in 1170 ms. (341 steps per ms) remains 17/17 properties
// Phase 1: matrix 71 rows 81 cols
[2025-06-01 00:03:47] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:03:47] [INFO ] State equation strengthened by 2 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) 46/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 4/67 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 14/81 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 71/152 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 97 constraints, problems are : Problem set: 0 solved, 17 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 81/81 constraints, ReadFeed: 2/2 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) 46/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 4/67 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 14/81 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:03:47] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 71/152 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 17/121 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 121 constraints, problems are : Problem set: 0 solved, 17 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 81/81 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 751 ms.
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 71/71 transitions.
Graph (complete) has 168 edges and 81 vertex of which 78 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 67 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 67 transition count 59
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 25 place count 66 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 60 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 60 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 59 transition count 52
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 43 place count 59 transition count 52
Applied a total of 43 rules in 16 ms. Remains 59 /81 variables (removed 22) and now considering 52/71 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 59/81 places, 52/71 transitions.
RANDOM walk for 4000000 steps (513114 resets) in 17259 ms. (231 steps per ms) remains 8/17 properties
BEST_FIRST walk for 4000001 steps (338790 resets) in 8294 ms. (482 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (338813 resets) in 8243 ms. (485 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (338968 resets) in 8276 ms. (483 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (339234 resets) in 8249 ms. (484 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (339058 resets) in 8215 ms. (486 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (338410 resets) in 8289 ms. (482 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (339016 resets) in 8175 ms. (489 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (338963 resets) in 8337 ms. (479 steps per ms) remains 8/8 properties
// Phase 1: matrix 52 rows 59 cols
[2025-06-01 00:04:11] [INFO ] Computed 12 invariants in 7 ms
[2025-06-01 00:04:11] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 33/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 52/107 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/111 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 75 constraints, problems are : Problem set: 0 solved, 8 unsolved in 150 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 33/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 00:04:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:04:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2025-06-01 00:04:11] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 52/107 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 00:04:11] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:04:11] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 00:04:12] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/111 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/111 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/111 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/111 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 89 constraints, problems are : Problem set: 0 solved, 8 unsolved in 433 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: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1009 ms.
Support contains 8 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 0 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
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 56 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 55 transition count 48
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 11 place count 55 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 14 place count 52 transition count 45
Applied a total of 14 rules in 13 ms. Remains 52 /59 variables (removed 7) and now considering 45/52 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 52/59 places, 45/52 transitions.
RANDOM walk for 4000000 steps (512902 resets) in 12195 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (339200 resets) in 8310 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (339122 resets) in 8140 ms. (491 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (339297 resets) in 8357 ms. (478 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (338824 resets) in 8182 ms. (488 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (338532 resets) in 8143 ms. (491 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (339380 resets) in 8235 ms. (485 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (338877 resets) in 8241 ms. (485 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (339180 resets) in 8250 ms. (484 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 1900 steps, run visited all 8 properties in 24 ms. (steps per millisecond=79 )
Probabilistic random walk after 1900 steps, saw 980 distinct states, run finished after 29 ms. (steps per millisecond=65 ) properties seen :8
Able to resolve query StableMarking after proving 100 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 67641 ms.
ITS solved all properties within timeout
BK_STOP 1748736273999
--------------------
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="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is 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 r084-tall-174860080300293"
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.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 '
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 ;