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.r014-tall-174853743400113.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 Anderson-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 667K 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 1748542328093

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:12:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:12:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:12:09] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-05-29 18:12:09] [INFO ] Transformed 401 places.
[2025-05-29 18:12:09] [INFO ] Transformed 1328 transitions.
[2025-05-29 18:12:09] [INFO ] Found NUPN structural information;
[2025-05-29 18:12:09] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 241 ms.
RANDOM walk for 40000 steps (8 resets) in 3445 ms. (11 steps per ms) remains 37/401 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
// Phase 1: matrix 1328 rows 401 cols
[2025-05-29 18:12:11] [INFO ] Computed 19 invariants in 44 ms
[2025-05-29 18:12:11] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 344/379 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 344/387 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 8/387 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 14/401 variables, 10/406 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 14/420 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2868 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 344/379 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 344/387 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 8/387 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 14/401 variables, 10/406 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 14/420 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-29 18:12:15] [INFO ] Deduced a trap composed of 208 places in 295 ms of which 31 ms to minimize.
[2025-05-29 18:12:15] [INFO ] Deduced a trap composed of 170 places in 289 ms of which 3 ms to minimize.
[2025-05-29 18:12:15] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 4 ms to minimize.
[2025-05-29 18:12:16] [INFO ] Deduced a trap composed of 98 places in 231 ms of which 3 ms to minimize.
[2025-05-29 18:12:16] [INFO ] Deduced a trap composed of 201 places in 222 ms of which 3 ms to minimize.
[2025-05-29 18:12:16] [INFO ] Deduced a trap composed of 205 places in 216 ms of which 3 ms to minimize.
[2025-05-29 18:12:16] [INFO ] Deduced a trap composed of 120 places in 241 ms of which 4 ms to minimize.
[2025-05-29 18:12:17] [INFO ] Deduced a trap composed of 222 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:12:17] [INFO ] Deduced a trap composed of 209 places in 230 ms of which 2 ms to minimize.
[2025-05-29 18:12:17] [INFO ] Deduced a trap composed of 192 places in 235 ms of which 3 ms to minimize.
[2025-05-29 18:12:17] [INFO ] Deduced a trap composed of 151 places in 220 ms of which 3 ms to minimize.
[2025-05-29 18:12:18] [INFO ] Deduced a trap composed of 109 places in 230 ms of which 3 ms to minimize.
[2025-05-29 18:12:18] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 3 ms to minimize.
[2025-05-29 18:12:18] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 4 ms to minimize.
[2025-05-29 18:12:18] [INFO ] Deduced a trap composed of 211 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:12:19] [INFO ] Deduced a trap composed of 217 places in 225 ms of which 3 ms to minimize.
[2025-05-29 18:12:19] [INFO ] Deduced a trap composed of 180 places in 227 ms of which 3 ms to minimize.
SMT process timed out in 8217ms, After SMT, problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 401 transition count 1304
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 377 transition count 1304
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 128 place count 297 transition count 440
Iterating global reduction 0 with 80 rules applied. Total rules applied 208 place count 297 transition count 440
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 272 place count 265 transition count 408
Applied a total of 272 rules in 112 ms. Remains 265 /401 variables (removed 136) and now considering 408/1328 (removed 920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 265/401 places, 408/1328 transitions.
RANDOM walk for 4000000 steps (8 resets) in 20634 ms. (193 steps per ms) remains 21/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1091 ms. (366 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 982 ms. (406 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 981 ms. (407 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 983 ms. (406 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400000 steps (8 resets) in 950 ms. (420 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 957 ms. (417 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 959 ms. (416 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 972 ms. (411 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (8 resets) in 960 ms. (416 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 960 ms. (416 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (8 resets) in 923 ms. (432 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 910 ms. (439 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400000 steps (8 resets) in 928 ms. (430 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 945 ms. (422 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (8 resets) in 902 ms. (442 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 994 ms. (402 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 920 ms. (434 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1174 ms. (340 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 925 ms. (431 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 890 ms. (448 steps per ms) remains 18/18 properties
// Phase 1: matrix 408 rows 265 cols
[2025-05-29 18:12:31] [INFO ] Computed 19 invariants in 9 ms
[2025-05-29 18:12:31] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 230/248 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 8/256 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 9/265 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 408/673 variables, 265/284 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 56/340 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/673 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 340 constraints, problems are : Problem set: 0 solved, 18 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 265/265 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 230/248 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 211 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 8/256 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 9/265 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 408/673 variables, 265/285 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 56/341 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 18/359 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/673 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 359 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2216 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 265/265 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints]
After SMT, in 2992ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 1 properties in 149 ms.
Support contains 17 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 408/408 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 249 transition count 392
Applied a total of 32 rules in 20 ms. Remains 249 /265 variables (removed 16) and now considering 392/408 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 249/265 places, 392/408 transitions.
RANDOM walk for 4000000 steps (8 resets) in 17255 ms. (231 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (8 resets) in 841 ms. (475 steps per ms) remains 14/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 741 ms. (539 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 733 ms. (544 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 748 ms. (534 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400001 steps (8 resets) in 761 ms. (524 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400001 steps (8 resets) in 746 ms. (535 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 740 ms. (539 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 731 ms. (546 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400001 steps (8 resets) in 727 ms. (549 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 722 ms. (553 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 710 ms. (562 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400001 steps (8 resets) in 745 ms. (536 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 747 ms. (534 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 755 ms. (529 steps per ms) remains 14/14 properties
// Phase 1: matrix 392 rows 249 cols
[2025-05-29 18:12:43] [INFO ] Computed 19 invariants in 6 ms
[2025-05-29 18:12:43] [INFO ] State equation strengthened by 56 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) 218/232 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 8/240 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/249 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 392/641 variables, 249/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 56/324 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/641 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 324 constraints, problems are : Problem set: 0 solved, 14 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 56/56 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) 218/232 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-05-29 18:12:44] [INFO ] Deduced a trap composed of 216 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 8/240 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 9/249 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 392/641 variables, 249/269 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 56/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 14/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 339 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 2000ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 1 properties in 2286 ms.
Support contains 13 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 392/392 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 245 transition count 388
Applied a total of 8 rules in 18 ms. Remains 245 /249 variables (removed 4) and now considering 388/392 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 245/249 places, 388/392 transitions.
RANDOM walk for 4000000 steps (8 resets) in 14567 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7003 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 7040 ms. (568 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7087 ms. (564 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 6706 ms. (596 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 6674 ms. (599 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6733 ms. (594 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6826 ms. (585 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6835 ms. (585 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6750 ms. (592 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6845 ms. (584 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6912 ms. (578 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6978 ms. (573 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 189369 steps, run visited all 12 properties in 1381 ms. (steps per millisecond=137 )
Probabilistic random walk after 189369 steps, saw 115179 distinct states, run finished after 1387 ms. (steps per millisecond=136 ) properties seen :12
Able to resolve query StableMarking after proving 401 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 71091 ms.
ITS solved all properties within timeout

BK_STOP 1748542400484

--------------------
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="Anderson-PT-08"
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 Anderson-PT-08, 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 r014-tall-174853743400113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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