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-174860080700478.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 EisenbergMcGuire-PT-04, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K 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 1748741154751

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:25:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 01:25:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:25:56] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-01 01:25:56] [INFO ] Transformed 196 places.
[2025-06-01 01:25:56] [INFO ] Transformed 448 transitions.
[2025-06-01 01:25:56] [INFO ] Found NUPN structural information;
[2025-06-01 01:25:56] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 239 ms.
RANDOM walk for 40000 steps (8 resets) in 2509 ms. (15 steps per ms) remains 46/196 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
[2025-06-01 01:25:57] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2025-06-01 01:25:57] [INFO ] Computed 13 invariants in 19 ms
[2025-06-01 01:25:57] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 137/183 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 137/190 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 2/185 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 7/192 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 284/476 variables, 192/396 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 112/508 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 4/480 variables, 4/512 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 18 (OVERLAPS) 0/480 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 517 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2528 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 137/183 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 137/190 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 2/185 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 7/192 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 7/205 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 4 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 284/476 variables, 192/408 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 112/520 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 24/544 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/476 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 18 (OVERLAPS) 4/480 variables, 4/548 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 22/575 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
SMT process timed out in 7655ms, After SMT, problems are : Problem set: 0 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 8 place count 192 transition count 404
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 88 place count 152 transition count 404
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 140 transition count 356
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 140 transition count 356
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 128 transition count 344
Applied a total of 136 rules in 89 ms. Remains 128 /196 variables (removed 68) and now considering 344/448 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 128/196 places, 344/448 transitions.
RANDOM walk for 4000000 steps (8 resets) in 27187 ms. (147 steps per ms) remains 43/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 41/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 571 ms. (699 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 570 ms. (700 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 566 ms. (705 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 596 ms. (670 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 801 ms. (498 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 570 ms. (700 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 566 ms. (705 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 555 ms. (719 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 572 ms. (698 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 568 ms. (702 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 570 ms. (700 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 571 ms. (699 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 568 ms. (702 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 572 ms. (698 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 572 ms. (698 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 584 ms. (683 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 41/41 properties
[2025-06-01 01:26:20] [INFO ] Flow matrix only has 180 transitions (discarded 164 similar events)
// Phase 1: matrix 180 rows 128 cols
[2025-06-01 01:26:20] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 01:26:20] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 75/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 8/124 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 180/304 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 4/308 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 217 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 75/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 8/124 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 180/304 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 76/227 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 24/251 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 4/308 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 17/273 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (OVERLAPS) 0/308 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 278 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3705 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 20/20 constraints]
After SMT, in 4955ms problems are : Problem set: 0 solved, 41 unsolved
Parikh walk visited 10 properties in 2311 ms.
Support contains 31 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 344/344 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 128 transition count 341
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 125 transition count 341
Applied a total of 6 rules in 16 ms. Remains 125 /128 variables (removed 3) and now considering 341/344 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 125/128 places, 341/344 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24203 ms. (165 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 551 ms. (724 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 541 ms. (738 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 551 ms. (724 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 543 ms. (735 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 548 ms. (728 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 547 ms. (729 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 548 ms. (728 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 546 ms. (731 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 551 ms. (724 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 552 ms. (723 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 540 ms. (739 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 526 ms. (759 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 544 ms. (733 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 547 ms. (729 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 544 ms. (733 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 30/30 properties
Finished probabilistic random walk after 192153 steps, run visited all 30 properties in 837 ms. (steps per millisecond=229 )
Probabilistic random walk after 192153 steps, saw 40472 distinct states, run finished after 841 ms. (steps per millisecond=228 ) properties seen :30
Able to resolve query StableMarking after proving 196 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 44769 ms.
ITS solved all properties within timeout

BK_STOP 1748741201065

--------------------
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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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-174860080700478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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