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.r168-tall-174881266700258.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 PolyORBLF-PT-S02J04T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 862K 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 1748899321163

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 21:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:22:02] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-02 21:22:02] [INFO ] Transformed 476 places.
[2025-06-02 21:22:02] [INFO ] Transformed 920 transitions.
[2025-06-02 21:22:02] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 229 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (15 resets) in 1889 ms. (21 steps per ms) remains 14/476 properties
BEST_FIRST walk for 40002 steps (12 resets) in 326 ms. (122 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (10 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 251 ms. (158 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 258 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (9 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (10 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (13 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (11 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
[2025-06-02 21:22:04] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-02 21:22:04] [INFO ] Computed 46 invariants in 43 ms
[2025-06-02 21:22:04] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 85/295 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 175/472 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/473 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/474 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 812/1286 variables, 474/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 2/1288 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1288 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2810 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 85/295 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 175/472 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-06-02 21:22:08] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 18 ms to minimize.
[2025-06-02 21:22:08] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-06-02 21:22:08] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2025-06-02 21:22:08] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/473 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/474 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 812/1286 variables, 474/523 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 7946ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 302 place count 324 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 314 place count 324 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 326 place count 312 transition count 662
Applied a total of 326 rules in 172 ms. Remains 312 /476 variables (removed 164) and now considering 662/824 (removed 162) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-02 21:22:12] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 312 cols
[2025-06-02 21:22:12] [INFO ] Computed 44 invariants in 18 ms
[2025-06-02 21:22:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 3 ms to minimize.
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 6 ms to minimize.
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:22:18] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2025-06-02 21:22:18] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
[2025-06-02 21:22:20] [INFO ] Deduced a trap composed of 152 places in 146 ms of which 4 ms to minimize.
[2025-06-02 21:22:20] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:22:21] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 149 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:22:23] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:22:23] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2025-06-02 21:22:26] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:22:28] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 1 ms to minimize.
[2025-06-02 21:22:28] [INFO ] Deduced a trap composed of 159 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:22:29] [INFO ] Deduced a trap composed of 179 places in 112 ms of which 2 ms to minimize.
[2025-06-02 21:22:29] [INFO ] Deduced a trap composed of 180 places in 118 ms of which 2 ms to minimize.
[2025-06-02 21:22:29] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:22:29] [INFO ] Deduced a trap composed of 174 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/962 variables, and 66 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2025-06-02 21:22:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/962 variables, and 67 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 26/26 constraints]
After SMT, in 41092ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 41106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41297 ms. Remains : 312/476 places, 662/824 transitions.
RANDOM walk for 4000000 steps (2294 resets) in 26287 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (981 resets) in 11717 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (1029 resets) in 11577 ms. (345 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (1004 resets) in 11588 ms. (345 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (1020 resets) in 11565 ms. (345 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (1040 resets) in 11559 ms. (346 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (946 resets) in 11648 ms. (343 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (949 resets) in 11656 ms. (343 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (986 resets) in 11651 ms. (343 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (988 resets) in 11550 ms. (346 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (1056 resets) in 11595 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (964 resets) in 11823 ms. (338 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (1013 resets) in 11922 ms. (335 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (986 resets) in 11690 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (987 resets) in 11614 ms. (344 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 8035013 steps, run timeout after 171001 ms. (steps per millisecond=46 ) properties seen :0 out of 14
Probabilistic random walk after 8035013 steps, saw 3595044 distinct states, run finished after 171007 ms. (steps per millisecond=46 ) properties seen :0
[2025-06-02 21:26:41] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 21:26:41] [INFO ] Invariant cache hit.
[2025-06-02 21:26:41] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 146/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 55/215 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 91/308 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/310 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 650/960 variables, 310/353 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/960 variables, 72/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/962 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/962 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/962 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 428 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 146/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 55/215 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 91/308 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 8 ms to minimize.
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:26:45] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 2 ms to minimize.
[2025-06-02 21:26:45] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-06-02 21:26:45] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 650/960 variables, 310/362 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 72/434 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem smplace_36 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 5786ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 662/662 transitions.
Applied a total of 0 rules in 26 ms. Remains 312 /312 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 312/312 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 662/662 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2025-06-02 21:26:47] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 21:26:47] [INFO ] Invariant cache hit.
[2025-06-02 21:26:48] [INFO ] Implicit Places using invariants in 321 ms returned [79, 157, 178, 180, 275, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 329 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/312 places, 662/662 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 302 transition count 658
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 302 transition count 658
Applied a total of 8 rules in 25 ms. Remains 302 /306 variables (removed 4) and now considering 658/662 (removed 4) transitions.
[2025-06-02 21:26:48] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
// Phase 1: matrix 646 rows 302 cols
[2025-06-02 21:26:48] [INFO ] Computed 38 invariants in 11 ms
[2025-06-02 21:26:48] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-02 21:26:48] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
[2025-06-02 21:26:48] [INFO ] Invariant cache hit.
[2025-06-02 21:26:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 21:26:51] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 3657 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 302/312 places, 658/662 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4028 ms. Remains : 302/312 places, 658/662 transitions.
Total runtime 289394 ms.
ITS solved all properties within timeout

BK_STOP 1748899612124

--------------------
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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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 r168-tall-174881266700258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;